/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 NOT_INCREMENTALLY -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 10:42:12,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 10:42:12,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 10:42:12,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 10:42:12,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 10:42:12,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 10:42:12,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 10:42:12,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 10:42:12,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 10:42:12,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 10:42:12,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 10:42:12,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 10:42:12,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 10:42:12,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 10:42:12,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 10:42:12,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 10:42:12,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 10:42:12,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 10:42:12,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 10:42:12,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 10:42:12,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 10:42:12,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 10:42:12,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 10:42:12,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 10:42:12,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 10:42:12,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 10:42:12,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 10:42:12,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 10:42:12,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 10:42:12,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 10:42:12,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 10:42:12,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 10:42:12,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 10:42:12,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 10:42:12,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 10:42:12,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 10:42:12,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 10:42:12,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 10:42:12,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 10:42:12,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 10:42:12,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 10:42:12,345 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 10:42:12,360 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 10:42:12,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 10:42:12,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 10:42:12,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 10:42:12,362 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 10:42:12,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 10:42:12,362 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 10:42:12,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 10:42:12,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 10:42:12,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 10:42:12,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 10:42:12,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 10:42:12,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 10:42:12,364 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 10:42:12,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 10:42:12,364 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 10:42:12,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 10:42:12,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 10:42:12,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 10:42:12,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 10:42:12,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 10:42:12,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 10:42:12,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 10:42:12,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 10:42:12,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 10:42:12,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 10:42:12,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:12,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 10:42:12,367 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 10:42:12,367 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 -> NOT_INCREMENTALLY [2020-07-21 10:42:12,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 10:42:12,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 10:42:12,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 10:42:12,667 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 10:42:12,667 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 10:42:12,669 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 10:42:12,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ea11ee6/3097ae066fc741bd8cc55ad5c4095739/FLAG57b11b382 [2020-07-21 10:42:13,232 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 10:42:13,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-21 10:42:13,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ea11ee6/3097ae066fc741bd8cc55ad5c4095739/FLAG57b11b382 [2020-07-21 10:42:13,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ea11ee6/3097ae066fc741bd8cc55ad5c4095739 [2020-07-21 10:42:13,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 10:42:13,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 10:42:13,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 10:42:13,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 10:42:13,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 10:42:13,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:42:13" (1/1) ... [2020-07-21 10:42:13,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1542a85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13, skipping insertion in model container [2020-07-21 10:42:13,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:42:13" (1/1) ... [2020-07-21 10:42:13,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 10:42:13,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 10:42:13,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 10:42:13,784 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 10:42:13,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 10:42:13,813 INFO L208 MainTranslator]: Completed translation [2020-07-21 10:42:13,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13 WrapperNode [2020-07-21 10:42:13,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 10:42:13,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 10:42:13,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 10:42:13,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 10:42:13,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13" (1/1) ... [2020-07-21 10:42:13,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13" (1/1) ... [2020-07-21 10:42:13,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13" (1/1) ... [2020-07-21 10:42:13,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13" (1/1) ... [2020-07-21 10:42:13,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13" (1/1) ... [2020-07-21 10:42:13,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13" (1/1) ... [2020-07-21 10:42:13,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13" (1/1) ... [2020-07-21 10:42:13,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 10:42:13,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 10:42:13,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 10:42:13,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 10:42:13,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13" (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 10:42:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 10:42:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 10:42:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-21 10:42:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 10:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 10:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 10:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-21 10:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 10:42:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 10:42:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 10:42:14,148 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 10:42:14,148 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 10:42:14,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:42:14 BoogieIcfgContainer [2020-07-21 10:42:14,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 10:42:14,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 10:42:14,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 10:42:14,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 10:42:14,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:42:13" (1/3) ... [2020-07-21 10:42:14,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17840ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:42:14, skipping insertion in model container [2020-07-21 10:42:14,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:42:13" (2/3) ... [2020-07-21 10:42:14,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17840ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:42:14, skipping insertion in model container [2020-07-21 10:42:14,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:42:14" (3/3) ... [2020-07-21 10:42:14,160 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-21 10:42:14,170 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 10:42:14,176 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 10:42:14,190 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 10:42:14,212 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 10:42:14,212 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 10:42:14,213 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 10:42:14,213 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 10:42:14,213 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 10:42:14,213 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 10:42:14,213 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 10:42:14,213 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 10:42:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-21 10:42:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 10:42:14,236 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:14,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:14,237 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-21 10:42:14,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:14,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [368173290] [2020-07-21 10:42:14,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:14,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 10:42:14,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:14,403 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 10:42:14,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 10:42:14,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [368173290] [2020-07-21 10:42:14,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 10:42:14,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 10:42:14,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772767490] [2020-07-21 10:42:14,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 10:42:14,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:14,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 10:42:14,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 10:42:14,431 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-21 10:42:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:14,548 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 10:42:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 10:42:14,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 10:42:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:14,565 INFO L225 Difference]: With dead ends: 35 [2020-07-21 10:42:14,565 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 10:42:14,570 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 10:42:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 10:42:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 10:42:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 10:42:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 10:42:14,636 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 10:42:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:14,638 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 10:42:14,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 10:42:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 10:42:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 10:42:14,650 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:14,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:14,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:14,867 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-21 10:42:14,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:14,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [218985054] [2020-07-21 10:42:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:14,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 10:42:14,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:14,921 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 10:42:14,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 10:42:14,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [218985054] [2020-07-21 10:42:14,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 10:42:14,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 10:42:14,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927416642] [2020-07-21 10:42:14,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 10:42:14,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:14,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 10:42:14,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 10:42:14,927 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 10:42:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:15,013 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 10:42:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 10:42:15,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 10:42:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:15,016 INFO L225 Difference]: With dead ends: 27 [2020-07-21 10:42:15,016 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 10:42:15,018 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 10:42:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 10:42:15,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 10:42:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 10:42:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 10:42:15,026 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 10:42:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:15,027 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 10:42:15,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 10:42:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 10:42:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 10:42:15,028 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:15,029 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 10:42:15,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:15,235 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:15,236 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-21 10:42:15,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:15,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502141693] [2020-07-21 10:42:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:15,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 10:42:15,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:15,332 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 10:42:15,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:15,539 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:15,587 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 10:42:15,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [502141693] [2020-07-21 10:42:15,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:15,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 10:42:15,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022043699] [2020-07-21 10:42:15,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 10:42:15,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:15,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 10:42:15,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 10:42:15,590 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-21 10:42:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:15,725 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-21 10:42:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 10:42:15,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-21 10:42:15,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:15,730 INFO L225 Difference]: With dead ends: 32 [2020-07-21 10:42:15,730 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 10:42:15,731 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 10:42:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 10:42:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-21 10:42:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 10:42:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 10:42:15,743 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-21 10:42:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:15,744 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 10:42:15,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 10:42:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 10:42:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 10:42:15,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:15,745 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 10:42:15,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:15,948 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:15,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:15,949 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-21 10:42:15,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:15,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [896015399] [2020-07-21 10:42:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:15,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 10:42:15,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:16,020 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 10:42:16,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:16,175 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:16,212 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 10:42:16,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [896015399] [2020-07-21 10:42:16,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:16,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 10:42:16,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300912102] [2020-07-21 10:42:16,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 10:42:16,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:16,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 10:42:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 10:42:16,216 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-21 10:42:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:16,325 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-21 10:42:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 10:42:16,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-21 10:42:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:16,329 INFO L225 Difference]: With dead ends: 37 [2020-07-21 10:42:16,329 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 10:42:16,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 10:42:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 10:42:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-21 10:42:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 10:42:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 10:42:16,347 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-21 10:42:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:16,348 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 10:42:16,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 10:42:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 10:42:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-21 10:42:16,353 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:16,353 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 10:42:16,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:16,567 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:16,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:16,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-21 10:42:16,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:16,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2104392247] [2020-07-21 10:42:16,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:16,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 10:42:16,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:16,668 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 10:42:16,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:16,906 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:16,907 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:16,965 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:16,966 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:17,016 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 10:42:17,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2104392247] [2020-07-21 10:42:17,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:17,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 10:42:17,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004615060] [2020-07-21 10:42:17,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 10:42:17,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:17,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 10:42:17,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 10:42:17,019 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-21 10:42:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:17,170 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-21 10:42:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 10:42:17,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-21 10:42:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:17,173 INFO L225 Difference]: With dead ends: 42 [2020-07-21 10:42:17,173 INFO L226 Difference]: Without dead ends: 38 [2020-07-21 10:42:17,174 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 10:42:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-21 10:42:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-21 10:42:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 10:42:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 10:42:17,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-21 10:42:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:17,186 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 10:42:17,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 10:42:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 10:42:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-21 10:42:17,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:17,188 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 10:42:17,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:17,399 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-21 10:42:17,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:17,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [528772720] [2020-07-21 10:42:17,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:17,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 10:42:17,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:17,471 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 10:42:17,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:17,697 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:17,746 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:17,747 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:17,783 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 10:42:17,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [528772720] [2020-07-21 10:42:17,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:17,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 10:42:17,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960950712] [2020-07-21 10:42:17,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 10:42:17,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:17,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 10:42:17,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 10:42:17,785 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-21 10:42:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:17,922 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-21 10:42:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 10:42:17,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-21 10:42:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:17,925 INFO L225 Difference]: With dead ends: 47 [2020-07-21 10:42:17,926 INFO L226 Difference]: Without dead ends: 43 [2020-07-21 10:42:17,926 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 10:42:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-21 10:42:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-21 10:42:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 10:42:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 10:42:17,937 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-21 10:42:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:17,937 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 10:42:17,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 10:42:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 10:42:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 10:42:17,940 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:17,940 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 10:42:18,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:18,144 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:18,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-21 10:42:18,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:18,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1700938876] [2020-07-21 10:42:18,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:18,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 10:42:18,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:18,240 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 10:42:18,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:18,667 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:18,748 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:18,749 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:18,801 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:18,802 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:18,844 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 10:42:18,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1700938876] [2020-07-21 10:42:18,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:18,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 10:42:18,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895932089] [2020-07-21 10:42:18,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 10:42:18,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:18,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 10:42:18,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 10:42:18,849 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-21 10:42:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:19,034 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-21 10:42:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 10:42:19,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-21 10:42:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:19,038 INFO L225 Difference]: With dead ends: 52 [2020-07-21 10:42:19,039 INFO L226 Difference]: Without dead ends: 48 [2020-07-21 10:42:19,040 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 10:42:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-21 10:42:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-21 10:42:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 10:42:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 10:42:19,070 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-21 10:42:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:19,071 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 10:42:19,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 10:42:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 10:42:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 10:42:19,077 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:19,077 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 10:42:19,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:19,294 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:19,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:19,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-21 10:42:19,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:19,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891303911] [2020-07-21 10:42:19,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:19,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 10:42:19,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-21 10:42:19,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:19,805 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:19,910 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:19,911 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:19,951 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2020-07-21 10:42:19,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891303911] [2020-07-21 10:42:19,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:19,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 10:42:19,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986127654] [2020-07-21 10:42:19,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 10:42:19,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:19,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 10:42:19,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 10:42:19,989 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 13 states. [2020-07-21 10:42:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:20,123 INFO L93 Difference]: Finished difference Result 57 states and 122 transitions. [2020-07-21 10:42:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 10:42:20,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-07-21 10:42:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:20,126 INFO L225 Difference]: With dead ends: 57 [2020-07-21 10:42:20,126 INFO L226 Difference]: Without dead ends: 53 [2020-07-21 10:42:20,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 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 10:42:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-21 10:42:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-07-21 10:42:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 10:42:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 10:42:20,139 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 96 [2020-07-21 10:42:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:20,139 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 10:42:20,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 10:42:20,140 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 10:42:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-21 10:42:20,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:20,142 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:20,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:20,357 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:20,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:20,357 INFO L82 PathProgramCache]: Analyzing trace with hash 838335741, now seen corresponding path program 4 times [2020-07-21 10:42:20,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:20,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2022053296] [2020-07-21 10:42:20,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:20,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 10:42:20,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 244 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2020-07-21 10:42:20,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:21,073 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:21,074 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:21,239 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:21,331 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:21,381 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 266 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2020-07-21 10:42:21,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2022053296] [2020-07-21 10:42:21,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:21,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 10:42:21,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086360985] [2020-07-21 10:42:21,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 10:42:21,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:21,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 10:42:21,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 10:42:21,434 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 15 states. [2020-07-21 10:42:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:21,706 INFO L93 Difference]: Finished difference Result 62 states and 144 transitions. [2020-07-21 10:42:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 10:42:21,707 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-07-21 10:42:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:21,709 INFO L225 Difference]: With dead ends: 62 [2020-07-21 10:42:21,709 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 10:42:21,710 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 10:42:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 10:42:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2020-07-21 10:42:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 10:42:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 10:42:21,722 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 117 [2020-07-21 10:42:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:21,722 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 10:42:21,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 10:42:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 10:42:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-21 10:42:21,725 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:21,726 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 21, 13, 13, 13, 13, 13, 13, 13, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:21,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:21,939 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2072922826, now seen corresponding path program 4 times [2020-07-21 10:42:21,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:21,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360894744] [2020-07-21 10:42:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:22,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 10:42:22,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 506 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2020-07-21 10:42:22,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:22,803 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:22,998 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:23,086 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:23,087 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:23,140 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:23,141 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 532 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2020-07-21 10:42:23,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360894744] [2020-07-21 10:42:23,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:23,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 10:42:23,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108957034] [2020-07-21 10:42:23,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 10:42:23,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 10:42:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 10:42:23,197 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 15 states. [2020-07-21 10:42:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:23,354 INFO L93 Difference]: Finished difference Result 67 states and 168 transitions. [2020-07-21 10:42:23,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 10:42:23,355 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2020-07-21 10:42:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:23,358 INFO L225 Difference]: With dead ends: 67 [2020-07-21 10:42:23,358 INFO L226 Difference]: Without dead ends: 63 [2020-07-21 10:42:23,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 356 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 10:42:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-21 10:42:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2020-07-21 10:42:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 10:42:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 10:42:23,370 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 190 [2020-07-21 10:42:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:23,371 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 10:42:23,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 10:42:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 10:42:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-21 10:42:23,375 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:23,375 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:23,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:23,590 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1082984306, now seen corresponding path program 5 times [2020-07-21 10:42:23,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:23,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076340056] [2020-07-21 10:42:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:23,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 10:42:23,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 967 refuted. 0 times theorem prover too weak. 3536 trivial. 0 not checked. [2020-07-21 10:42:23,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:25,008 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:25,330 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:25,475 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:25,565 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:25,615 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:25,616 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 1002 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2020-07-21 10:42:25,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076340056] [2020-07-21 10:42:25,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:25,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 10:42:25,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648367598] [2020-07-21 10:42:25,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 10:42:25,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 10:42:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 10:42:25,726 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-21 10:42:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:25,956 INFO L93 Difference]: Finished difference Result 72 states and 194 transitions. [2020-07-21 10:42:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 10:42:25,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 286 [2020-07-21 10:42:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:25,959 INFO L225 Difference]: With dead ends: 72 [2020-07-21 10:42:25,960 INFO L226 Difference]: Without dead ends: 68 [2020-07-21 10:42:25,961 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 545 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 10:42:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-21 10:42:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2020-07-21 10:42:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 10:42:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 10:42:25,989 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 286 [2020-07-21 10:42:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:25,990 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 10:42:25,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 10:42:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 10:42:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-07-21 10:42:25,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:25,998 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 34, 21, 21, 21, 21, 21, 21, 21, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:26,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:26,208 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1006419304, now seen corresponding path program 5 times [2020-07-21 10:42:26,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:26,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209495065] [2020-07-21 10:42:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:26,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 10:42:26,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1055 refuted. 0 times theorem prover too weak. 3799 trivial. 0 not checked. [2020-07-21 10:42:26,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:27,628 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:27,939 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:28,102 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:28,211 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:28,212 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:28,257 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1095 refuted. 0 times theorem prover too weak. 3759 trivial. 0 not checked. [2020-07-21 10:42:28,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209495065] [2020-07-21 10:42:28,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:28,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 10:42:28,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930371755] [2020-07-21 10:42:28,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 10:42:28,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:28,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 10:42:28,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 10:42:28,328 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 17 states. [2020-07-21 10:42:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:28,518 INFO L93 Difference]: Finished difference Result 77 states and 222 transitions. [2020-07-21 10:42:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 10:42:28,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 299 [2020-07-21 10:42:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:28,522 INFO L225 Difference]: With dead ends: 77 [2020-07-21 10:42:28,522 INFO L226 Difference]: Without dead ends: 73 [2020-07-21 10:42:28,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 570 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 10:42:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-21 10:42:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2020-07-21 10:42:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 10:42:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 10:42:28,534 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 299 [2020-07-21 10:42:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:28,535 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 10:42:28,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 10:42:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 10:42:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2020-07-21 10:42:28,545 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:28,546 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 39, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:28,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:28,759 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:28,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:28,759 INFO L82 PathProgramCache]: Analyzing trace with hash 785285043, now seen corresponding path program 6 times [2020-07-21 10:42:28,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:28,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371165630] [2020-07-21 10:42:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:28,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 10:42:28,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2126 refuted. 0 times theorem prover too weak. 12702 trivial. 0 not checked. [2020-07-21 10:42:29,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:31,075 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:31,588 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:31,953 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:32,145 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:32,146 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:32,227 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:32,277 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:32,277 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2177 refuted. 0 times theorem prover too weak. 12651 trivial. 0 not checked. [2020-07-21 10:42:32,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371165630] [2020-07-21 10:42:32,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:32,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-21 10:42:32,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922674440] [2020-07-21 10:42:32,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-21 10:42:32,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-21 10:42:32,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-21 10:42:32,465 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 19 states. [2020-07-21 10:42:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:32,914 INFO L93 Difference]: Finished difference Result 82 states and 252 transitions. [2020-07-21 10:42:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 10:42:32,915 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 507 [2020-07-21 10:42:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:32,921 INFO L225 Difference]: With dead ends: 82 [2020-07-21 10:42:32,921 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 10:42:32,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 983 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 10:42:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 10:42:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2020-07-21 10:42:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 10:42:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 10:42:32,944 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 507 [2020-07-21 10:42:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:32,946 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 10:42:32,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-21 10:42:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 10:42:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2020-07-21 10:42:32,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:32,951 INFO L422 BasicCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:33,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:33,164 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1350718391, now seen corresponding path program 6 times [2020-07-21 10:42:33,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:33,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [95017007] [2020-07-21 10:42:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:33,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 10:42:33,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2020-07-21 10:42:33,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:35,256 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:35,855 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:35,856 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:36,189 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:36,190 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:36,345 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:36,432 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:36,432 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:36,477 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1975 refuted. 0 times theorem prover too weak. 9374 trivial. 0 not checked. [2020-07-21 10:42:36,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [95017007] [2020-07-21 10:42:36,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:36,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-21 10:42:36,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311692037] [2020-07-21 10:42:36,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-21 10:42:36,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-21 10:42:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-21 10:42:36,608 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 19 states. [2020-07-21 10:42:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:36,858 INFO L93 Difference]: Finished difference Result 87 states and 284 transitions. [2020-07-21 10:42:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 10:42:36,858 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 450 [2020-07-21 10:42:36,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:36,862 INFO L225 Difference]: With dead ends: 87 [2020-07-21 10:42:36,862 INFO L226 Difference]: Without dead ends: 83 [2020-07-21 10:42:36,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 868 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 10:42:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-21 10:42:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2020-07-21 10:42:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 10:42:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 10:42:36,884 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 450 [2020-07-21 10:42:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:36,884 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 10:42:36,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-21 10:42:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 10:42:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2020-07-21 10:42:36,896 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:36,896 INFO L422 BasicCegarLoop]: trace histogram [163, 163, 82, 81, 81, 81, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:37,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:37,112 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash 40336450, now seen corresponding path program 7 times [2020-07-21 10:42:37,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:37,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [251288321] [2020-07-21 10:42:37,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:37,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 2380 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 10:42:37,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 69012 backedges. 797 proven. 5632 refuted. 0 times theorem prover too weak. 62583 trivial. 0 not checked. [2020-07-21 10:42:38,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:41,845 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:41,846 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:43,011 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:43,513 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:43,514 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:43,852 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:43,853 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:44,013 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:44,014 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:44,103 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:44,104 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:44,158 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 69012 backedges. 797 proven. 5702 refuted. 0 times theorem prover too weak. 62513 trivial. 0 not checked. [2020-07-21 10:42:44,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [251288321] [2020-07-21 10:42:44,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:44,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-21 10:42:44,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859452311] [2020-07-21 10:42:44,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 10:42:44,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:44,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 10:42:44,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 10:42:44,653 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 21 states. [2020-07-21 10:42:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:45,302 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-21 10:42:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 10:42:45,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1066 [2020-07-21 10:42:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:45,308 INFO L225 Difference]: With dead ends: 92 [2020-07-21 10:42:45,308 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 10:42:45,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2140 GetRequests, 2097 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-21 10:42:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 10:42:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 10:42:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 10:42:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 10:42:45,322 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 1066 [2020-07-21 10:42:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:45,324 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 10:42:45,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 10:42:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 10:42:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2020-07-21 10:42:45,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:45,329 INFO L422 BasicCegarLoop]: trace histogram [95, 95, 79, 47, 47, 47, 47, 47, 47, 47, 32, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:45,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:45,543 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:45,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:45,543 INFO L82 PathProgramCache]: Analyzing trace with hash -312379166, now seen corresponding path program 7 times [2020-07-21 10:42:45,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:45,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [69889778] [2020-07-21 10:42:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:45,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 10:42:45,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 25265 backedges. 501 proven. 3394 refuted. 0 times theorem prover too weak. 21370 trivial. 0 not checked. [2020-07-21 10:42:46,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:48,801 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:48,801 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:49,650 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:50,119 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:50,120 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:50,389 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:50,389 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:50,575 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:50,667 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:50,726 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 25265 backedges. 501 proven. 3471 refuted. 0 times theorem prover too weak. 21293 trivial. 0 not checked. [2020-07-21 10:42:51,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [69889778] [2020-07-21 10:42:51,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:42:51,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-21 10:42:51,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065062304] [2020-07-21 10:42:51,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 10:42:51,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:42:51,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 10:42:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 10:42:51,256 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 21 states. [2020-07-21 10:42:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:42:51,722 INFO L93 Difference]: Finished difference Result 97 states and 354 transitions. [2020-07-21 10:42:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 10:42:51,722 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 656 [2020-07-21 10:42:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:42:51,727 INFO L225 Difference]: With dead ends: 97 [2020-07-21 10:42:51,727 INFO L226 Difference]: Without dead ends: 93 [2020-07-21 10:42:51,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1319 GetRequests, 1276 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-21 10:42:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-21 10:42:51,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2020-07-21 10:42:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 10:42:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 10:42:51,746 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 656 [2020-07-21 10:42:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:42:51,747 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 10:42:51,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 10:42:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 10:42:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1275 [2020-07-21 10:42:51,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:42:51,762 INFO L422 BasicCegarLoop]: trace histogram [195, 195, 98, 97, 97, 97, 97, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:42:51,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:42:51,978 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:42:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:42:51,979 INFO L82 PathProgramCache]: Analyzing trace with hash 971855614, now seen corresponding path program 8 times [2020-07-21 10:42:51,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:42:51,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [295691136] [2020-07-21 10:42:51,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:42:52,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 2844 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 10:42:52,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:42:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 98940 backedges. 1168 proven. 7570 refuted. 0 times theorem prover too weak. 90202 trivial. 0 not checked. [2020-07-21 10:42:53,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:42:57,735 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:42:59,528 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:00,392 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:00,924 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:00,925 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:01,239 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:01,240 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:01,455 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:01,550 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:01,551 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:01,603 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:01,604 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 98940 backedges. 1168 proven. 7662 refuted. 0 times theorem prover too weak. 90110 trivial. 0 not checked. [2020-07-21 10:43:02,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [295691136] [2020-07-21 10:43:02,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:43:02,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2020-07-21 10:43:02,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910432454] [2020-07-21 10:43:02,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-21 10:43:02,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:43:02,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-21 10:43:02,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2020-07-21 10:43:02,249 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 23 states. [2020-07-21 10:43:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:43:03,005 INFO L93 Difference]: Finished difference Result 102 states and 392 transitions. [2020-07-21 10:43:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 10:43:03,006 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1274 [2020-07-21 10:43:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:43:03,013 INFO L225 Difference]: With dead ends: 102 [2020-07-21 10:43:03,013 INFO L226 Difference]: Without dead ends: 98 [2020-07-21 10:43:03,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2557 GetRequests, 2509 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2020-07-21 10:43:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-21 10:43:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2020-07-21 10:43:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 10:43:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-21 10:43:03,038 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1274 [2020-07-21 10:43:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:43:03,040 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-21 10:43:03,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-21 10:43:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-21 10:43:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1821 [2020-07-21 10:43:03,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:43:03,070 INFO L422 BasicCegarLoop]: trace histogram [267, 267, 211, 133, 133, 133, 133, 133, 133, 133, 78, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:43:03,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:43:03,284 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:43:03,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:43:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1926911020, now seen corresponding path program 8 times [2020-07-21 10:43:03,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:43:03,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [503468918] [2020-07-21 10:43:03,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:43:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:43:03,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 4044 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 10:43:03,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:43:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 199311 backedges. 1523 proven. 11417 refuted. 0 times theorem prover too weak. 186371 trivial. 0 not checked. [2020-07-21 10:43:05,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:43:11,488 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:13,536 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:13,537 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:14,730 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:14,730 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:15,287 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:15,681 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:15,681 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:15,899 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:15,991 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:16,043 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 199311 backedges. 1523 proven. 11517 refuted. 0 times theorem prover too weak. 186271 trivial. 0 not checked. [2020-07-21 10:43:17,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [503468918] [2020-07-21 10:43:17,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:43:17,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-21 10:43:17,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284432458] [2020-07-21 10:43:17,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 10:43:17,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:43:17,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 10:43:17,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-21 10:43:17,192 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 22 states. [2020-07-21 10:43:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:43:17,943 INFO L93 Difference]: Finished difference Result 107 states and 432 transitions. [2020-07-21 10:43:17,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 10:43:17,944 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1820 [2020-07-21 10:43:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:43:17,951 INFO L225 Difference]: With dead ends: 107 [2020-07-21 10:43:17,951 INFO L226 Difference]: Without dead ends: 103 [2020-07-21 10:43:17,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3648 GetRequests, 3600 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 10:43:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-21 10:43:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2020-07-21 10:43:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 10:43:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-21 10:43:17,969 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1820 [2020-07-21 10:43:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:43:17,971 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-21 10:43:17,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 10:43:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-21 10:43:17,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2029 [2020-07-21 10:43:18,000 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:43:18,001 INFO L422 BasicCegarLoop]: trace histogram [311, 311, 156, 155, 155, 155, 155, 155, 155, 155, 155, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:43:18,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:43:18,214 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:43:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:43:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2013442466, now seen corresponding path program 9 times [2020-07-21 10:43:18,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:43:18,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [819691434] [2020-07-21 10:43:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:43:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:43:19,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 4526 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 10:43:19,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:43:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 252495 backedges. 2059 proven. 13739 refuted. 0 times theorem prover too weak. 236697 trivial. 0 not checked. [2020-07-21 10:43:20,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:43:27,692 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:31,109 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:33,084 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:33,950 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:33,951 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:34,595 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:34,595 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:34,960 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:34,961 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:35,160 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:35,261 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:35,315 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 252495 backedges. 2059 proven. 13856 refuted. 0 times theorem prover too weak. 236580 trivial. 0 not checked. [2020-07-21 10:43:36,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [819691434] [2020-07-21 10:43:36,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:43:36,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-21 10:43:36,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183092394] [2020-07-21 10:43:36,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-21 10:43:36,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:43:36,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-21 10:43:36,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-21 10:43:36,714 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 24 states. [2020-07-21 10:43:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:43:37,751 INFO L93 Difference]: Finished difference Result 112 states and 474 transitions. [2020-07-21 10:43:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 10:43:37,752 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2028 [2020-07-21 10:43:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:43:37,760 INFO L225 Difference]: With dead ends: 112 [2020-07-21 10:43:37,760 INFO L226 Difference]: Without dead ends: 108 [2020-07-21 10:43:37,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4066 GetRequests, 4013 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-21 10:43:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-21 10:43:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2020-07-21 10:43:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-21 10:43:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 178 transitions. [2020-07-21 10:43:37,776 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 178 transitions. Word has length 2028 [2020-07-21 10:43:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:43:37,778 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 178 transitions. [2020-07-21 10:43:37,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-21 10:43:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 178 transitions. [2020-07-21 10:43:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3355 [2020-07-21 10:43:37,839 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:43:37,841 INFO L422 BasicCegarLoop]: trace histogram [491, 491, 401, 245, 245, 245, 245, 245, 245, 245, 156, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:43:38,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:43:38,042 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:43:38,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:43:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1199798370, now seen corresponding path program 9 times [2020-07-21 10:43:38,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:43:38,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1896332074] [2020-07-21 10:43:38,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:43:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:43:39,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 7448 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 10:43:39,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:43:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 680940 backedges. 3664 proven. 24319 refuted. 0 times theorem prover too weak. 652957 trivial. 0 not checked. [2020-07-21 10:43:43,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:43:53,831 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:59,691 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:43:59,692 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:02,637 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:04,224 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:04,844 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:05,110 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:05,293 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:05,420 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:05,421 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:05,493 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:05,575 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 680940 backedges. 3674 proven. 24426 refuted. 0 times theorem prover too weak. 652840 trivial. 0 not checked. [2020-07-21 10:44:09,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1896332074] [2020-07-21 10:44:09,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:44:09,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-21 10:44:09,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609798204] [2020-07-21 10:44:09,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-21 10:44:09,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:44:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-21 10:44:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-21 10:44:09,123 INFO L87 Difference]: Start difference. First operand 66 states and 178 transitions. Second operand 24 states. [2020-07-21 10:44:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:44:09,708 INFO L93 Difference]: Finished difference Result 289 states and 3051 transitions. [2020-07-21 10:44:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 10:44:09,709 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 3354 [2020-07-21 10:44:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:44:09,717 INFO L225 Difference]: With dead ends: 289 [2020-07-21 10:44:09,717 INFO L226 Difference]: Without dead ends: 85 [2020-07-21 10:44:09,733 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6717 GetRequests, 6664 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-21 10:44:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-21 10:44:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-07-21 10:44:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-21 10:44:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 140 transitions. [2020-07-21 10:44:09,757 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 140 transitions. Word has length 3354 [2020-07-21 10:44:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:44:09,759 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 140 transitions. [2020-07-21 10:44:09,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-21 10:44:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 140 transitions. [2020-07-21 10:44:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1489 [2020-07-21 10:44:09,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:44:09,786 INFO L422 BasicCegarLoop]: trace histogram [215, 215, 191, 107, 107, 107, 107, 107, 107, 107, 84, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:44:10,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:44:10,002 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:44:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:44:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash 114559272, now seen corresponding path program 10 times [2020-07-21 10:44:10,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:44:10,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2118948482] [2020-07-21 10:44:10,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:44:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:44:10,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 10:44:10,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:44:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 132849 backedges. 1654 proven. 8876 refuted. 0 times theorem prover too weak. 122319 trivial. 0 not checked. [2020-07-21 10:44:11,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:44:16,969 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:19,084 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:20,296 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,101 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,567 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,568 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,803 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,804 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,904 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,905 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,964 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,965 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:21,998 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:22,023 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:44:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 132849 backedges. 1678 proven. 8946 refuted. 0 times theorem prover too weak. 122225 trivial. 0 not checked. [2020-07-21 10:44:22,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2118948482] [2020-07-21 10:44:22,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:44:22,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-21 10:44:22,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462884232] [2020-07-21 10:44:22,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 10:44:22,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:44:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 10:44:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-21 10:44:22,786 INFO L87 Difference]: Start difference. First operand 85 states and 140 transitions. Second operand 22 states. [2020-07-21 10:44:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:44:23,407 INFO L93 Difference]: Finished difference Result 294 states and 697 transitions. [2020-07-21 10:44:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 10:44:23,409 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1488 [2020-07-21 10:44:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:44:23,414 INFO L225 Difference]: With dead ends: 294 [2020-07-21 10:44:23,414 INFO L226 Difference]: Without dead ends: 93 [2020-07-21 10:44:23,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2984 GetRequests, 2936 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 10:44:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-21 10:44:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2020-07-21 10:44:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-21 10:44:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2020-07-21 10:44:23,442 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 1488 [2020-07-21 10:44:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:44:23,442 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2020-07-21 10:44:23,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 10:44:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2020-07-21 10:44:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-21 10:44:23,460 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:44:23,461 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 10:44:23,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:44:23,676 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:44:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:44:23,677 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 11 times [2020-07-21 10:44:23,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:44:23,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [16954535] [2020-07-21 10:44:23,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:44:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 10:44:24,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 10:44:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 10:44:24,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 10:44:24,845 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 10:44:24,846 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 10:44:25,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:44:25,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 10:44:25 BoogieIcfgContainer [2020-07-21 10:44:25,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 10:44:25,306 INFO L168 Benchmark]: Toolchain (without parser) took 131716.44 ms. Allocated memory was 145.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 102.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2020-07-21 10:44:25,306 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 10:44:25,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.22 ms. Allocated memory is still 145.2 MB. Free memory was 102.2 MB in the beginning and 92.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-21 10:44:25,307 INFO L168 Benchmark]: Boogie Preprocessor took 26.19 ms. Allocated memory is still 145.2 MB. Free memory was 92.8 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 10:44:25,308 INFO L168 Benchmark]: RCFGBuilder took 311.04 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 91.2 MB in the beginning and 170.6 MB in the end (delta: -79.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-21 10:44:25,308 INFO L168 Benchmark]: TraceAbstraction took 131149.94 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2020-07-21 10:44:25,311 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 223.22 ms. Allocated memory is still 145.2 MB. Free memory was 102.2 MB in the beginning and 92.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.19 ms. Allocated memory is still 145.2 MB. Free memory was 92.8 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 311.04 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 91.2 MB in the beginning and 170.6 MB in the end (delta: -79.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 131149.94 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [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: 130.8s, OverallIterations: 22, TraceHistogramMax: 491, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 1820 SDslu, 1831 SDs, 0 SdLazy, 2326 SolverSat, 4421 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27797 GetRequests, 27147 SyntacticMatches, 238 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2326 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 407 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 110.8s InterpolantComputationTime, 15068 NumberOfCodeBlocks, 15068 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 27645 ConstructedInterpolants, 0 QuantifiedInterpolants, 54663847 SizeOfPredicates, 140 NumberOfNonLiveVariables, 30859 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 2832402/2997438 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...