./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b225e80ee922ecd6d28f97f9a97339f737a7de4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:43:44,282 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:43:44,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:43:44,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:43:44,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:43:44,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:43:44,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:43:44,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:43:44,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:43:44,299 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:43:44,300 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:43:44,300 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:43:44,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:43:44,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:43:44,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:43:44,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:43:44,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:43:44,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:43:44,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:43:44,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:43:44,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:43:44,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:43:44,311 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:43:44,312 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:43:44,312 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:43:44,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:43:44,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:43:44,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:43:44,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:43:44,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:43:44,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:43:44,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:43:44,316 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:43:44,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:43:44,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:43:44,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:43:44,319 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 22:43:44,330 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:43:44,330 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:43:44,331 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:43:44,331 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:43:44,334 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:43:44,335 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:43:44,335 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:43:44,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:43:44,335 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:43:44,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:43:44,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:43:44,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:43:44,336 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:43:44,336 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:43:44,336 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:43:44,336 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:43:44,336 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:43:44,337 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:43:44,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:43:44,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:43:44,337 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:43:44,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:43:44,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:43:44,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:43:44,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:43:44,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:43:44,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 22:43:44,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:43:44,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:43:44,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b225e80ee922ecd6d28f97f9a97339f737a7de4 [2018-10-26 22:43:44,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:43:44,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:43:44,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:43:44,390 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:43:44,390 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:43:44,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-10-26 22:43:44,437 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/data/f733ec260/57571608e37d4770aef10ab47529c165/FLAG204cffe26 [2018-10-26 22:43:44,791 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:43:44,791 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-10-26 22:43:44,796 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/data/f733ec260/57571608e37d4770aef10ab47529c165/FLAG204cffe26 [2018-10-26 22:43:44,808 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/data/f733ec260/57571608e37d4770aef10ab47529c165 [2018-10-26 22:43:44,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:43:44,812 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:43:44,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:43:44,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:43:44,817 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:43:44,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:43:44" (1/1) ... [2018-10-26 22:43:44,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@524d3618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44, skipping insertion in model container [2018-10-26 22:43:44,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:43:44" (1/1) ... [2018-10-26 22:43:44,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:43:44,840 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:43:44,953 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:43:44,955 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:43:44,966 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:43:44,975 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:43:44,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44 WrapperNode [2018-10-26 22:43:44,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:43:44,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:43:44,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:43:44,977 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:43:44,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44" (1/1) ... [2018-10-26 22:43:44,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44" (1/1) ... [2018-10-26 22:43:44,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44" (1/1) ... [2018-10-26 22:43:44,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44" (1/1) ... [2018-10-26 22:43:44,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44" (1/1) ... [2018-10-26 22:43:44,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44" (1/1) ... [2018-10-26 22:43:44,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44" (1/1) ... [2018-10-26 22:43:45,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:43:45,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:43:45,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:43:45,000 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:43:45,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/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 [2018-10-26 22:43:45,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:43:45,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:43:45,111 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-10-26 22:43:45,111 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-10-26 22:43:45,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:43:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 22:43:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 22:43:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-10-26 22:43:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-10-26 22:43:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:43:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:43:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:43:45,549 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:43:45,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:43:45 BoogieIcfgContainer [2018-10-26 22:43:45,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:43:45,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:43:45,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:43:45,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:43:45,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:43:44" (1/3) ... [2018-10-26 22:43:45,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce7ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:43:45, skipping insertion in model container [2018-10-26 22:43:45,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:43:44" (2/3) ... [2018-10-26 22:43:45,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce7ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:43:45, skipping insertion in model container [2018-10-26 22:43:45,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:43:45" (3/3) ... [2018-10-26 22:43:45,556 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10_false-unreach-call.c [2018-10-26 22:43:45,566 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:43:45,573 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:43:45,587 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:43:45,612 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:43:45,613 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:43:45,613 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:43:45,613 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:43:45,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:43:45,614 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:43:45,614 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:43:45,614 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:43:45,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:43:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-10-26 22:43:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 22:43:45,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:45,636 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:45,639 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:45,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-10-26 22:43:45,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:45,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:45,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:45,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:45,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:45,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:43:45,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:43:45,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:43:45,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:43:45,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:43:45,921 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-10-26 22:43:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:46,058 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-10-26 22:43:46,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:43:46,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-26 22:43:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:46,067 INFO L225 Difference]: With dead ends: 44 [2018-10-26 22:43:46,067 INFO L226 Difference]: Without dead ends: 30 [2018-10-26 22:43:46,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:43:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-26 22:43:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-26 22:43:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-26 22:43:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-10-26 22:43:46,106 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-10-26 22:43:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:46,107 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-10-26 22:43:46,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:43:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-10-26 22:43:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 22:43:46,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:46,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:46,108 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:46,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-10-26 22:43:46,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:46,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:46,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:46,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:46,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:46,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:43:46,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:43:46,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:43:46,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:43:46,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:43:46,176 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-10-26 22:43:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:46,410 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-10-26 22:43:46,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:43:46,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-26 22:43:46,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:46,411 INFO L225 Difference]: With dead ends: 36 [2018-10-26 22:43:46,411 INFO L226 Difference]: Without dead ends: 32 [2018-10-26 22:43:46,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:43:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-26 22:43:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-10-26 22:43:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-26 22:43:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-10-26 22:43:46,418 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-10-26 22:43:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:46,418 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-10-26 22:43:46,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:43:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-10-26 22:43:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 22:43:46,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:46,419 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:46,420 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:46,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-10-26 22:43:46,421 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:46,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:46,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:43:46,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:46,546 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:43:46,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:46,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:43:46,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:46,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-10-26 22:43:46,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:43:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:43:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:43:46,697 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-10-26 22:43:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:47,258 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-10-26 22:43:47,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:43:47,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-10-26 22:43:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:47,259 INFO L225 Difference]: With dead ends: 58 [2018-10-26 22:43:47,259 INFO L226 Difference]: Without dead ends: 34 [2018-10-26 22:43:47,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:43:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-26 22:43:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-10-26 22:43:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-26 22:43:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-10-26 22:43:47,268 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-10-26 22:43:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:47,268 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-10-26 22:43:47,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:43:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-10-26 22:43:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:43:47,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:47,270 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:47,270 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:47,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:47,273 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-10-26 22:43:47,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:47,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:47,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:47,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:43:47,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:47,378 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:47,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:47,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:43:47,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:47,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-26 22:43:47,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:43:47,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:43:47,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:43:47,452 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-10-26 22:43:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:47,560 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-10-26 22:43:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:43:47,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-10-26 22:43:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:47,562 INFO L225 Difference]: With dead ends: 43 [2018-10-26 22:43:47,562 INFO L226 Difference]: Without dead ends: 39 [2018-10-26 22:43:47,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:43:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-26 22:43:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-26 22:43:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-26 22:43:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-10-26 22:43:47,569 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-10-26 22:43:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:47,570 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-10-26 22:43:47,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:43:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-10-26 22:43:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 22:43:47,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:47,571 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:47,571 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:47,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:47,572 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-10-26 22:43:47,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:47,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:47,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:47,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:47,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:43:47,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:47,659 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:47,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:47,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 22:43:47,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:47,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-10-26 22:43:47,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 22:43:47,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 22:43:47,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:43:47,784 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-10-26 22:43:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:48,077 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-10-26 22:43:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:43:48,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-10-26 22:43:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:48,079 INFO L225 Difference]: With dead ends: 70 [2018-10-26 22:43:48,079 INFO L226 Difference]: Without dead ends: 39 [2018-10-26 22:43:48,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:43:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-26 22:43:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-26 22:43:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-26 22:43:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-10-26 22:43:48,086 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-10-26 22:43:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:48,087 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-10-26 22:43:48,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 22:43:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-10-26 22:43:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 22:43:48,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:48,088 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:48,089 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:48,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-10-26 22:43:48,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:48,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:48,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:48,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:48,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:48,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:43:48,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:48,166 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:48,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:48,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:43:48,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:48,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-10-26 22:43:48,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 22:43:48,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 22:43:48,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:43:48,302 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-10-26 22:43:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:48,429 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-10-26 22:43:48,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:43:48,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-10-26 22:43:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:48,431 INFO L225 Difference]: With dead ends: 61 [2018-10-26 22:43:48,431 INFO L226 Difference]: Without dead ends: 57 [2018-10-26 22:43:48,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:43:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-26 22:43:48,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-10-26 22:43:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 22:43:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-10-26 22:43:48,441 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-10-26 22:43:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:48,441 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-10-26 22:43:48,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 22:43:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-10-26 22:43:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-26 22:43:48,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:48,443 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:48,443 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:48,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:48,443 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-10-26 22:43:48,443 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:48,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:48,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:48,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:43:48,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:48,520 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:48,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:48,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 22:43:48,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:48,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-10-26 22:43:48,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 22:43:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 22:43:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:43:48,608 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-10-26 22:43:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:48,908 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-10-26 22:43:48,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:43:48,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-10-26 22:43:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:48,910 INFO L225 Difference]: With dead ends: 71 [2018-10-26 22:43:48,910 INFO L226 Difference]: Without dead ends: 67 [2018-10-26 22:43:48,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:43:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-26 22:43:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-10-26 22:43:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 22:43:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-10-26 22:43:48,920 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-10-26 22:43:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:48,920 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-10-26 22:43:48,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 22:43:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-10-26 22:43:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 22:43:48,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:48,924 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:48,924 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:48,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-10-26 22:43:48,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:48,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:48,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:48,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:48,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-26 22:43:49,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:49,032 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:49,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:43:49,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:43:49,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:43:49,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-26 22:43:49,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:49,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-10-26 22:43:49,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 22:43:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 22:43:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:43:49,181 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-10-26 22:43:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:49,940 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-10-26 22:43:49,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:43:49,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-10-26 22:43:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:49,944 INFO L225 Difference]: With dead ends: 146 [2018-10-26 22:43:49,944 INFO L226 Difference]: Without dead ends: 103 [2018-10-26 22:43:49,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:43:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-26 22:43:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-10-26 22:43:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-26 22:43:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-10-26 22:43:49,977 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-10-26 22:43:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:49,980 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-10-26 22:43:49,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 22:43:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-10-26 22:43:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-26 22:43:49,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:49,984 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:49,985 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:49,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1162514868, now seen corresponding path program 1 times [2018-10-26 22:43:49,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:49,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:49,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:43:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 77 proven. 154 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-10-26 22:43:50,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:50,203 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:50,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:50,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 40 proven. 230 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-26 22:43:50,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:50,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-10-26 22:43:50,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 22:43:50,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 22:43:50,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-10-26 22:43:50,937 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-10-26 22:43:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:51,834 INFO L93 Difference]: Finished difference Result 232 states and 520 transitions. [2018-10-26 22:43:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 22:43:51,838 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 162 [2018-10-26 22:43:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:51,840 INFO L225 Difference]: With dead ends: 232 [2018-10-26 22:43:51,840 INFO L226 Difference]: Without dead ends: 129 [2018-10-26 22:43:51,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 22:43:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-26 22:43:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-10-26 22:43:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-26 22:43:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2018-10-26 22:43:51,872 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 162 [2018-10-26 22:43:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:51,875 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-10-26 22:43:51,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 22:43:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2018-10-26 22:43:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-26 22:43:51,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:51,879 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 16, 16, 15, 13, 11, 11, 11, 11, 11, 11, 11, 10, 8, 8, 8, 8, 8, 8, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:51,880 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:51,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash 287168718, now seen corresponding path program 2 times [2018-10-26 22:43:51,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:51,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:51,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:51,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:43:51,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2007 backedges. 336 proven. 113 refuted. 0 times theorem prover too weak. 1558 trivial. 0 not checked. [2018-10-26 22:43:52,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:52,100 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:52,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:43:52,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:43:52,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:43:52,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2007 backedges. 91 proven. 518 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2018-10-26 22:43:52,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:52,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2018-10-26 22:43:52,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 22:43:52,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 22:43:52,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-10-26 22:43:52,437 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 18 states. [2018-10-26 22:43:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:52,969 INFO L93 Difference]: Finished difference Result 277 states and 496 transitions. [2018-10-26 22:43:52,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 22:43:52,969 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 269 [2018-10-26 22:43:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:52,971 INFO L225 Difference]: With dead ends: 277 [2018-10-26 22:43:52,971 INFO L226 Difference]: Without dead ends: 158 [2018-10-26 22:43:52,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:43:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-26 22:43:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 147. [2018-10-26 22:43:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-26 22:43:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 248 transitions. [2018-10-26 22:43:52,991 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 248 transitions. Word has length 269 [2018-10-26 22:43:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:52,992 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 248 transitions. [2018-10-26 22:43:52,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 22:43:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 248 transitions. [2018-10-26 22:43:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-26 22:43:53,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:53,002 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 32, 32, 29, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 13, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:53,002 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:53,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1125647128, now seen corresponding path program 3 times [2018-10-26 22:43:53,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:53,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:53,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:53,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:43:53,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6119 backedges. 659 proven. 219 refuted. 0 times theorem prover too weak. 5241 trivial. 0 not checked. [2018-10-26 22:43:53,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:53,255 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:53,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:43:53,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 22:43:53,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:43:53,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6119 backedges. 755 proven. 7 refuted. 0 times theorem prover too weak. 5357 trivial. 0 not checked. [2018-10-26 22:43:53,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:53,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2018-10-26 22:43:53,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:43:53,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:43:53,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:43:53,466 INFO L87 Difference]: Start difference. First operand 147 states and 248 transitions. Second operand 13 states. [2018-10-26 22:43:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:54,065 INFO L93 Difference]: Finished difference Result 291 states and 544 transitions. [2018-10-26 22:43:54,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:43:54,067 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 464 [2018-10-26 22:43:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:54,069 INFO L225 Difference]: With dead ends: 291 [2018-10-26 22:43:54,069 INFO L226 Difference]: Without dead ends: 142 [2018-10-26 22:43:54,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-10-26 22:43:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-26 22:43:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-10-26 22:43:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-26 22:43:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 234 transitions. [2018-10-26 22:43:54,086 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 234 transitions. Word has length 464 [2018-10-26 22:43:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:54,087 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 234 transitions. [2018-10-26 22:43:54,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:43:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 234 transitions. [2018-10-26 22:43:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-26 22:43:54,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:54,095 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 26, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:54,095 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:54,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:54,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1745001759, now seen corresponding path program 4 times [2018-10-26 22:43:54,096 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:54,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:54,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:54,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:43:54,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5065 backedges. 210 proven. 448 refuted. 0 times theorem prover too weak. 4407 trivial. 0 not checked. [2018-10-26 22:43:54,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:54,760 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:54,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:43:54,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:43:54,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:43:54,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5065 backedges. 138 proven. 1041 refuted. 0 times theorem prover too weak. 3886 trivial. 0 not checked. [2018-10-26 22:43:55,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:55,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 16 [2018-10-26 22:43:55,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 22:43:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 22:43:55,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:43:55,207 INFO L87 Difference]: Start difference. First operand 142 states and 234 transitions. Second operand 16 states. [2018-10-26 22:43:56,075 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 22:43:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:56,567 INFO L93 Difference]: Finished difference Result 308 states and 598 transitions. [2018-10-26 22:43:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:43:56,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 424 [2018-10-26 22:43:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:56,569 INFO L225 Difference]: With dead ends: 308 [2018-10-26 22:43:56,569 INFO L226 Difference]: Without dead ends: 168 [2018-10-26 22:43:56,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-10-26 22:43:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-26 22:43:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2018-10-26 22:43:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-26 22:43:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 285 transitions. [2018-10-26 22:43:56,587 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 285 transitions. Word has length 424 [2018-10-26 22:43:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:56,587 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 285 transitions. [2018-10-26 22:43:56,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 22:43:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 285 transitions. [2018-10-26 22:43:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2018-10-26 22:43:56,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:56,597 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 65, 58, 39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 26, 20, 20, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:56,598 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:56,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2069253922, now seen corresponding path program 5 times [2018-10-26 22:43:56,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:56,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:43:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 33225 backedges. 2311 proven. 1489 refuted. 0 times theorem prover too weak. 29425 trivial. 0 not checked. [2018-10-26 22:43:57,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:57,422 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:57,428 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:43:57,716 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-10-26 22:43:57,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:43:57,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 33225 backedges. 14292 proven. 68 refuted. 0 times theorem prover too weak. 18865 trivial. 0 not checked. [2018-10-26 22:43:58,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:43:58,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 23 [2018-10-26 22:43:58,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:43:58,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:43:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:43:58,524 INFO L87 Difference]: Start difference. First operand 159 states and 285 transitions. Second operand 23 states. [2018-10-26 22:43:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:59,368 INFO L93 Difference]: Finished difference Result 409 states and 980 transitions. [2018-10-26 22:43:59,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 22:43:59,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1060 [2018-10-26 22:43:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:59,372 INFO L225 Difference]: With dead ends: 409 [2018-10-26 22:43:59,373 INFO L226 Difference]: Without dead ends: 259 [2018-10-26 22:43:59,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1100 GetRequests, 1061 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2018-10-26 22:43:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-26 22:43:59,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2018-10-26 22:43:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-26 22:43:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 463 transitions. [2018-10-26 22:43:59,398 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 463 transitions. Word has length 1060 [2018-10-26 22:43:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:59,398 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 463 transitions. [2018-10-26 22:43:59,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:43:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 463 transitions. [2018-10-26 22:43:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2018-10-26 22:43:59,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:59,407 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 58, 50, 50, 44, 36, 36, 36, 36, 36, 36, 36, 33, 25, 25, 25, 25, 25, 25, 25, 15, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:59,407 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:59,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1943342050, now seen corresponding path program 6 times [2018-10-26 22:43:59,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:43:59,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:43:59,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:59,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:43:59,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:43:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21731 backedges. 571 proven. 1120 refuted. 0 times theorem prover too weak. 20040 trivial. 0 not checked. [2018-10-26 22:44:00,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:00,315 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:00,332 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 22:44:00,430 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-26 22:44:00,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:00,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21731 backedges. 1463 proven. 4 refuted. 0 times theorem prover too weak. 20264 trivial. 0 not checked. [2018-10-26 22:44:00,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:00,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-26 22:44:00,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:44:00,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:44:00,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:44:00,762 INFO L87 Difference]: Start difference. First operand 234 states and 463 transitions. Second operand 7 states. [2018-10-26 22:44:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:01,647 INFO L93 Difference]: Finished difference Result 451 states and 1063 transitions. [2018-10-26 22:44:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 22:44:01,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 847 [2018-10-26 22:44:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:01,650 INFO L225 Difference]: With dead ends: 451 [2018-10-26 22:44:01,651 INFO L226 Difference]: Without dead ends: 222 [2018-10-26 22:44:01,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:44:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-26 22:44:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-10-26 22:44:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-26 22:44:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 420 transitions. [2018-10-26 22:44:01,671 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 420 transitions. Word has length 847 [2018-10-26 22:44:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:01,672 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 420 transitions. [2018-10-26 22:44:01,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:44:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 420 transitions. [2018-10-26 22:44:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2018-10-26 22:44:01,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:01,692 INFO L375 BasicCegarLoop]: trace histogram [123, 123, 106, 106, 94, 90, 61, 61, 61, 61, 61, 61, 61, 53, 53, 53, 53, 53, 53, 53, 41, 29, 29, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:01,692 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:01,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:01,692 INFO L82 PathProgramCache]: Analyzing trace with hash -136670233, now seen corresponding path program 7 times [2018-10-26 22:44:01,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:01,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:01,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:01,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:44:01,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:02,642 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 22:44:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 73480 backedges. 781 proven. 4142 refuted. 0 times theorem prover too weak. 68557 trivial. 0 not checked. [2018-10-26 22:44:03,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:03,330 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:03,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:44:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:03,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 73480 backedges. 677 proven. 4870 refuted. 0 times theorem prover too weak. 67933 trivial. 0 not checked. [2018-10-26 22:44:04,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:04,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2018-10-26 22:44:04,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:44:04,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:44:04,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:44:04,585 INFO L87 Difference]: Start difference. First operand 222 states and 420 transitions. Second operand 23 states. [2018-10-26 22:44:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:06,150 INFO L93 Difference]: Finished difference Result 463 states and 1046 transitions. [2018-10-26 22:44:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-26 22:44:06,151 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1565 [2018-10-26 22:44:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:06,154 INFO L225 Difference]: With dead ends: 463 [2018-10-26 22:44:06,155 INFO L226 Difference]: Without dead ends: 240 [2018-10-26 22:44:06,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1611 GetRequests, 1558 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=462, Invalid=2508, Unknown=0, NotChecked=0, Total=2970 [2018-10-26 22:44:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-26 22:44:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 194. [2018-10-26 22:44:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-26 22:44:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 292 transitions. [2018-10-26 22:44:06,190 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 292 transitions. Word has length 1565 [2018-10-26 22:44:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:06,190 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 292 transitions. [2018-10-26 22:44:06,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:44:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 292 transitions. [2018-10-26 22:44:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1173 [2018-10-26 22:44:06,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:06,202 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 84, 84, 72, 67, 43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 42, 30, 24, 17, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:06,202 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:06,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:06,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2038675610, now seen corresponding path program 8 times [2018-10-26 22:44:06,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:06,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:06,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:06,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:44:06,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 40731 backedges. 794 proven. 3738 refuted. 0 times theorem prover too weak. 36199 trivial. 0 not checked. [2018-10-26 22:44:07,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:07,211 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:07,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:44:07,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:44:07,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:07,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 40731 backedges. 725 proven. 2894 refuted. 0 times theorem prover too weak. 37112 trivial. 0 not checked. [2018-10-26 22:44:08,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:08,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 23 [2018-10-26 22:44:08,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:44:08,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:44:08,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:44:08,765 INFO L87 Difference]: Start difference. First operand 194 states and 292 transitions. Second operand 23 states. [2018-10-26 22:44:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:10,675 INFO L93 Difference]: Finished difference Result 415 states and 670 transitions. [2018-10-26 22:44:10,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-26 22:44:10,675 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1172 [2018-10-26 22:44:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:10,678 INFO L225 Difference]: With dead ends: 415 [2018-10-26 22:44:10,678 INFO L226 Difference]: Without dead ends: 234 [2018-10-26 22:44:10,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1221 GetRequests, 1169 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=425, Invalid=2437, Unknown=0, NotChecked=0, Total=2862 [2018-10-26 22:44:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-26 22:44:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 199. [2018-10-26 22:44:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-26 22:44:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2018-10-26 22:44:10,696 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 1172 [2018-10-26 22:44:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:10,697 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2018-10-26 22:44:10,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:44:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2018-10-26 22:44:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2018-10-26 22:44:10,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:10,708 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 76, 76, 68, 64, 43, 43, 43, 43, 43, 43, 43, 38, 38, 38, 38, 38, 38, 38, 30, 21, 19, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:10,709 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:10,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1316986166, now seen corresponding path program 9 times [2018-10-26 22:44:10,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:10,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:10,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:10,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:44:10,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 37082 backedges. 2534 proven. 1473 refuted. 0 times theorem prover too weak. 33075 trivial. 0 not checked. [2018-10-26 22:44:11,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:11,385 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:11,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:44:11,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-26 22:44:11,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:11,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 37082 backedges. 6607 proven. 157 refuted. 0 times theorem prover too weak. 30318 trivial. 0 not checked. [2018-10-26 22:44:11,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:11,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 22 [2018-10-26 22:44:11,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-26 22:44:11,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-26 22:44:11,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-10-26 22:44:11,944 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand 22 states. [2018-10-26 22:44:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:12,859 INFO L93 Difference]: Finished difference Result 426 states and 677 transitions. [2018-10-26 22:44:12,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-26 22:44:12,860 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1117 [2018-10-26 22:44:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:12,862 INFO L225 Difference]: With dead ends: 426 [2018-10-26 22:44:12,862 INFO L226 Difference]: Without dead ends: 225 [2018-10-26 22:44:12,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1160 GetRequests, 1115 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=1832, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 22:44:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-26 22:44:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2018-10-26 22:44:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-26 22:44:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-10-26 22:44:12,880 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 1117 [2018-10-26 22:44:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:12,881 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-10-26 22:44:12,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-26 22:44:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-10-26 22:44:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1444 [2018-10-26 22:44:12,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:12,898 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 105, 105, 87, 83, 53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 52, 52, 52, 52, 34, 31, 23, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:12,898 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:12,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash 582757578, now seen corresponding path program 10 times [2018-10-26 22:44:12,899 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:12,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:12,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:12,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:44:12,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:13,790 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 22:44:14,154 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-10-26 22:44:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 948 proven. 4943 refuted. 0 times theorem prover too weak. 56169 trivial. 0 not checked. [2018-10-26 22:44:15,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:15,139 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:15,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:44:15,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:44:15,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:15,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 918 proven. 3589 refuted. 0 times theorem prover too weak. 57553 trivial. 0 not checked. [2018-10-26 22:44:16,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:16,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 25 [2018-10-26 22:44:16,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-26 22:44:16,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-26 22:44:16,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:44:16,706 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 25 states. [2018-10-26 22:44:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:17,682 INFO L93 Difference]: Finished difference Result 442 states and 696 transitions. [2018-10-26 22:44:17,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-26 22:44:17,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1443 [2018-10-26 22:44:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:17,685 INFO L225 Difference]: With dead ends: 442 [2018-10-26 22:44:17,686 INFO L226 Difference]: Without dead ends: 257 [2018-10-26 22:44:17,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1501 GetRequests, 1440 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=541, Invalid=3365, Unknown=0, NotChecked=0, Total=3906 [2018-10-26 22:44:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-26 22:44:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 216. [2018-10-26 22:44:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-26 22:44:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 316 transitions. [2018-10-26 22:44:17,712 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 316 transitions. Word has length 1443 [2018-10-26 22:44:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:17,713 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 316 transitions. [2018-10-26 22:44:17,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-26 22:44:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 316 transitions. [2018-10-26 22:44:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1703 [2018-10-26 22:44:17,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:17,734 INFO L375 BasicCegarLoop]: trace histogram [130, 130, 119, 119, 102, 99, 65, 65, 65, 65, 65, 65, 65, 59, 59, 59, 59, 59, 59, 59, 43, 34, 28, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:17,734 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:17,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:17,735 INFO L82 PathProgramCache]: Analyzing trace with hash 72622893, now seen corresponding path program 11 times [2018-10-26 22:44:17,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:17,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:17,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:17,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:44:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 86790 backedges. 2257 proven. 5046 refuted. 0 times theorem prover too weak. 79487 trivial. 0 not checked. [2018-10-26 22:44:19,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:19,153 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:19,160 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:44:19,298 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2018-10-26 22:44:19,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:19,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 86790 backedges. 38801 proven. 334 refuted. 0 times theorem prover too weak. 47655 trivial. 0 not checked. [2018-10-26 22:44:20,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:20,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 20 [2018-10-26 22:44:20,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 22:44:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 22:44:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-26 22:44:20,283 INFO L87 Difference]: Start difference. First operand 216 states and 316 transitions. Second operand 20 states. [2018-10-26 22:44:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:21,282 INFO L93 Difference]: Finished difference Result 449 states and 707 transitions. [2018-10-26 22:44:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 22:44:21,283 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1702 [2018-10-26 22:44:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:21,286 INFO L225 Difference]: With dead ends: 449 [2018-10-26 22:44:21,286 INFO L226 Difference]: Without dead ends: 255 [2018-10-26 22:44:21,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1737 GetRequests, 1704 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 22:44:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-26 22:44:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 224. [2018-10-26 22:44:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-26 22:44:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 327 transitions. [2018-10-26 22:44:21,307 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 327 transitions. Word has length 1702 [2018-10-26 22:44:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:21,308 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 327 transitions. [2018-10-26 22:44:21,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-26 22:44:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 327 transitions. [2018-10-26 22:44:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-10-26 22:44:21,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:21,319 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:21,320 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:21,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:21,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1627069240, now seen corresponding path program 12 times [2018-10-26 22:44:21,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:21,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:21,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:21,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:44:21,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2126 proven. 649 refuted. 0 times theorem prover too weak. 28861 trivial. 0 not checked. [2018-10-26 22:44:22,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:22,196 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:22,202 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 22:44:22,374 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-26 22:44:22,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:22,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 1705 proven. 257 refuted. 0 times theorem prover too weak. 29674 trivial. 0 not checked. [2018-10-26 22:44:23,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:23,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2018-10-26 22:44:23,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:44:23,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:44:23,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:44:23,112 INFO L87 Difference]: Start difference. First operand 224 states and 327 transitions. Second operand 13 states. [2018-10-26 22:44:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:23,387 INFO L93 Difference]: Finished difference Result 244 states and 375 transitions. [2018-10-26 22:44:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:44:23,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1035 [2018-10-26 22:44:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:23,390 INFO L225 Difference]: With dead ends: 244 [2018-10-26 22:44:23,390 INFO L226 Difference]: Without dead ends: 240 [2018-10-26 22:44:23,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 1040 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-10-26 22:44:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-26 22:44:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 232. [2018-10-26 22:44:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-26 22:44:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 349 transitions. [2018-10-26 22:44:23,407 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 349 transitions. Word has length 1035 [2018-10-26 22:44:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:23,408 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 349 transitions. [2018-10-26 22:44:23,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:44:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 349 transitions. [2018-10-26 22:44:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1935 [2018-10-26 22:44:23,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:23,434 INFO L375 BasicCegarLoop]: trace histogram [142, 142, 141, 141, 115, 114, 71, 71, 71, 71, 71, 71, 71, 70, 70, 70, 70, 70, 70, 70, 44, 44, 28, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:23,434 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:23,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1934595156, now seen corresponding path program 13 times [2018-10-26 22:44:23,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:23,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:23,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:23,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:44:23,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 112120 backedges. 2758 proven. 6655 refuted. 0 times theorem prover too weak. 102707 trivial. 0 not checked. [2018-10-26 22:44:24,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:24,996 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:25,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:44:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:25,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 112120 backedges. 1843 proven. 5307 refuted. 0 times theorem prover too weak. 104970 trivial. 0 not checked. [2018-10-26 22:44:26,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:26,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 31 [2018-10-26 22:44:26,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-26 22:44:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-26 22:44:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2018-10-26 22:44:26,961 INFO L87 Difference]: Start difference. First operand 232 states and 349 transitions. Second operand 31 states. [2018-10-26 22:44:28,498 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-26 22:44:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:29,060 INFO L93 Difference]: Finished difference Result 574 states and 1038 transitions. [2018-10-26 22:44:29,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-26 22:44:29,061 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1934 [2018-10-26 22:44:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:29,064 INFO L225 Difference]: With dead ends: 574 [2018-10-26 22:44:29,064 INFO L226 Difference]: Without dead ends: 308 [2018-10-26 22:44:29,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1929 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=599, Invalid=3957, Unknown=0, NotChecked=0, Total=4556 [2018-10-26 22:44:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-26 22:44:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 273. [2018-10-26 22:44:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-26 22:44:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 344 transitions. [2018-10-26 22:44:29,088 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 344 transitions. Word has length 1934 [2018-10-26 22:44:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:29,090 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 344 transitions. [2018-10-26 22:44:29,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-26 22:44:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 344 transitions. [2018-10-26 22:44:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1254 [2018-10-26 22:44:29,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:29,102 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 90, 90, 74, 74, 46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 29, 28, 19, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:29,103 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:29,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:29,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1983723242, now seen corresponding path program 14 times [2018-10-26 22:44:29,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:29,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:29,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:44:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:29,960 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 22:44:30,310 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-10-26 22:44:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 46634 backedges. 1082 proven. 4674 refuted. 0 times theorem prover too weak. 40878 trivial. 0 not checked. [2018-10-26 22:44:31,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:31,765 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:31,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:44:31,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:44:31,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:31,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 46634 backedges. 1080 proven. 2803 refuted. 0 times theorem prover too weak. 42751 trivial. 0 not checked. [2018-10-26 22:44:33,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:33,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 26 [2018-10-26 22:44:33,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-26 22:44:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-26 22:44:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-10-26 22:44:33,099 INFO L87 Difference]: Start difference. First operand 273 states and 344 transitions. Second operand 26 states. [2018-10-26 22:44:34,310 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-26 22:44:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:34,660 INFO L93 Difference]: Finished difference Result 606 states and 784 transitions. [2018-10-26 22:44:34,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-26 22:44:34,662 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1253 [2018-10-26 22:44:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:34,664 INFO L225 Difference]: With dead ends: 606 [2018-10-26 22:44:34,664 INFO L226 Difference]: Without dead ends: 350 [2018-10-26 22:44:34,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1319 GetRequests, 1253 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=604, Invalid=3952, Unknown=0, NotChecked=0, Total=4556 [2018-10-26 22:44:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-26 22:44:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 277. [2018-10-26 22:44:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-26 22:44:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 347 transitions. [2018-10-26 22:44:34,689 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 347 transitions. Word has length 1253 [2018-10-26 22:44:34,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:34,689 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 347 transitions. [2018-10-26 22:44:34,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-26 22:44:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 347 transitions. [2018-10-26 22:44:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-10-26 22:44:34,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:34,700 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 65, 65, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 25, 25, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:34,700 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:34,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:34,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1604839333, now seen corresponding path program 15 times [2018-10-26 22:44:34,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:34,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:34,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:34,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:44:34,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:35,538 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 22:44:35,882 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-10-26 22:44:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 36000 backedges. 1478 proven. 4114 refuted. 0 times theorem prover too weak. 30408 trivial. 0 not checked. [2018-10-26 22:44:36,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:36,975 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:36,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:44:37,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-10-26 22:44:37,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:37,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 36000 backedges. 1262 proven. 1275 refuted. 0 times theorem prover too weak. 33463 trivial. 0 not checked. [2018-10-26 22:44:37,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:37,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 28 [2018-10-26 22:44:37,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-26 22:44:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-26 22:44:37,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2018-10-26 22:44:37,573 INFO L87 Difference]: Start difference. First operand 277 states and 347 transitions. Second operand 28 states. [2018-10-26 22:44:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:38,816 INFO L93 Difference]: Finished difference Result 561 states and 713 transitions. [2018-10-26 22:44:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-26 22:44:38,816 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1103 [2018-10-26 22:44:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:38,819 INFO L225 Difference]: With dead ends: 561 [2018-10-26 22:44:38,819 INFO L226 Difference]: Without dead ends: 367 [2018-10-26 22:44:38,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1181 GetRequests, 1105 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=747, Invalid=5259, Unknown=0, NotChecked=0, Total=6006 [2018-10-26 22:44:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-26 22:44:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 282. [2018-10-26 22:44:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-26 22:44:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2018-10-26 22:44:38,845 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 1103 [2018-10-26 22:44:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:38,847 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2018-10-26 22:44:38,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-26 22:44:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2018-10-26 22:44:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1390 [2018-10-26 22:44:38,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:38,862 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 82, 82, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 32, 31, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:38,862 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:38,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1927837140, now seen corresponding path program 16 times [2018-10-26 22:44:38,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:38,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:38,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:44:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2149 proven. 6053 refuted. 0 times theorem prover too weak. 49244 trivial. 0 not checked. [2018-10-26 22:44:40,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:44:40,962 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:44:40,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:44:41,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:44:41,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:41,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2107 proven. 2950 refuted. 0 times theorem prover too weak. 52389 trivial. 0 not checked. [2018-10-26 22:44:41,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:41,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 28 [2018-10-26 22:44:41,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-26 22:44:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-26 22:44:41,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2018-10-26 22:44:41,772 INFO L87 Difference]: Start difference. First operand 282 states and 347 transitions. Second operand 28 states. [2018-10-26 22:44:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:42,662 INFO L93 Difference]: Finished difference Result 495 states and 610 transitions. [2018-10-26 22:44:42,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-26 22:44:42,663 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1389 [2018-10-26 22:44:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:42,666 INFO L225 Difference]: With dead ends: 495 [2018-10-26 22:44:42,666 INFO L226 Difference]: Without dead ends: 293 [2018-10-26 22:44:42,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1457 GetRequests, 1394 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=531, Invalid=3501, Unknown=0, NotChecked=0, Total=4032 [2018-10-26 22:44:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-26 22:44:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-10-26 22:44:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-26 22:44:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 358 transitions. [2018-10-26 22:44:42,691 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 358 transitions. Word has length 1389 [2018-10-26 22:44:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:42,692 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 358 transitions. [2018-10-26 22:44:42,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-26 22:44:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 358 transitions. [2018-10-26 22:44:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-10-26 22:44:42,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:42,704 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:42,704 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:42,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:42,704 INFO L82 PathProgramCache]: Analyzing trace with hash 416823031, now seen corresponding path program 17 times [2018-10-26 22:44:42,704 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:44:42,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:44:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:42,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:44:42,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:44:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:44:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:44:42,928 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 22:44:43,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:44:43 BoogieIcfgContainer [2018-10-26 22:44:43,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:44:43,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:44:43,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:44:43,067 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:44:43,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:43:45" (3/4) ... [2018-10-26 22:44:43,071 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 22:44:43,220 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3f3e1387-c6c4-479f-9656-f8f76dd88b28/bin-2019/uautomizer/witness.graphml [2018-10-26 22:44:43,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:44:43,224 INFO L168 Benchmark]: Toolchain (without parser) took 58412.58 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 955.8 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-10-26 22:44:43,225 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:44:43,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.57 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:44:43,226 INFO L168 Benchmark]: Boogie Preprocessor took 23.37 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:44:43,226 INFO L168 Benchmark]: RCFGBuilder took 549.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:44:43,226 INFO L168 Benchmark]: TraceAbstraction took 57516.83 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-10-26 22:44:43,226 INFO L168 Benchmark]: Witness Printer took 156.76 ms. Allocated memory is still 4.2 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-10-26 22:44:43,228 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.57 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.37 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 549.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57516.83 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 156.76 ms. Allocated memory is still 4.2 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] RET return fibo2(n-1) + fibo2(n-2); [L37] EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 57.4s OverallTime, 25 OverallIterations, 142 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 893 SDtfs, 2121 SDslu, 7455 SDs, 0 SdLazy, 13343 SolverSat, 2325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17968 GetRequests, 17183 SyntacticMatches, 3 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9227 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=293occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 494 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 35649 NumberOfCodeBlocks, 30274 NumberOfCodeBlocksAsserted, 194 NumberOfCheckSat, 34391 ConstructedInterpolants, 0 QuantifiedInterpolants, 48113091 SizeOfPredicates, 149 NumberOfNonLiveVariables, 25941 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 46 InterpolantComputations, 2 PerfectInterpolantSequences, 1234501/1305988 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...