./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca069cb8d4103e8fb4700634948424bd87542bc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-5842f4b [2018-11-18 14:00:09,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:00:09,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:00:09,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:00:09,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:00:09,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:00:09,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:00:09,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:00:09,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:00:09,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:00:09,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:00:09,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:00:09,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:00:09,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:00:09,363 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:00:09,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:00:09,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:00:09,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:00:09,366 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:00:09,367 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:00:09,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:00:09,369 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:00:09,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:00:09,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:00:09,371 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:00:09,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:00:09,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:00:09,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:00:09,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:00:09,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:00:09,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:00:09,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:00:09,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:00:09,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:00:09,374 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:00:09,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:00:09,375 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:00:09,383 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:00:09,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:00:09,383 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:00:09,384 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:00:09,384 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:00:09,384 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:00:09,384 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:00:09,384 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:00:09,384 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:00:09,384 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:00:09,385 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:00:09,385 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:00:09,385 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:00:09,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:00:09,386 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:00:09,386 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:00:09,386 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:00:09,386 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:00:09,386 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:00:09,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:00:09,386 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:00:09,386 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:00:09,387 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:00:09,387 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:00:09,387 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:00:09,387 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:00:09,387 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:00:09,387 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:00:09,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:00:09,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:00:09,388 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:00:09,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:00:09,388 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:00:09,388 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:00:09,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:00:09,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:00:09,388 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:00:09,389 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan 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 -> Taipan 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 -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2018-11-18 14:00:09,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:00:09,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:00:09,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:00:09,425 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:00:09,425 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:00:09,426 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-18 14:00:09,462 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/data/8ceb687fa/f4211c15c6b94b92b3817e3d9779949d/FLAGc10863d94 [2018-11-18 14:00:09,858 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:00:09,858 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-18 14:00:09,863 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/data/8ceb687fa/f4211c15c6b94b92b3817e3d9779949d/FLAGc10863d94 [2018-11-18 14:00:09,873 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/data/8ceb687fa/f4211c15c6b94b92b3817e3d9779949d [2018-11-18 14:00:09,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:00:09,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:00:09,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:00:09,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:00:09,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:00:09,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:00:09" (1/1) ... [2018-11-18 14:00:09,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300c35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:09, skipping insertion in model container [2018-11-18 14:00:09,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:00:09" (1/1) ... [2018-11-18 14:00:09,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:00:09,897 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:00:10,001 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:00:10,003 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:00:10,012 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:00:10,019 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:00:10,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10 WrapperNode [2018-11-18 14:00:10,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:00:10,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:00:10,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:00:10,021 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:00:10,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... [2018-11-18 14:00:10,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... [2018-11-18 14:00:10,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:00:10,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:00:10,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:00:10,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:00:10,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... [2018-11-18 14:00:10,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... [2018-11-18 14:00:10,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... [2018-11-18 14:00:10,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... [2018-11-18 14:00:10,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... [2018-11-18 14:00:10,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... [2018-11-18 14:00:10,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... [2018-11-18 14:00:10,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:00:10,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:00:10,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:00:10,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:00:10,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/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-11-18 14:00:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:00:10,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:00:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:00:10,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:00:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:00:10,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:00:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-18 14:00:10,112 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-18 14:00:10,198 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:00:10,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:00:10 BoogieIcfgContainer [2018-11-18 14:00:10,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:00:10,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:00:10,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:00:10,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:00:10,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:00:09" (1/3) ... [2018-11-18 14:00:10,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e536da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:00:10, skipping insertion in model container [2018-11-18 14:00:10,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:00:10" (2/3) ... [2018-11-18 14:00:10,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e536da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:00:10, skipping insertion in model container [2018-11-18 14:00:10,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:00:10" (3/3) ... [2018-11-18 14:00:10,203 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2018-11-18 14:00:10,209 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:00:10,213 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:00:10,222 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:00:10,241 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:00:10,241 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:00:10,241 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:00:10,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:00:10,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:00:10,241 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:00:10,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:00:10,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:00:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-18 14:00:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 14:00:10,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:10,257 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:10,259 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:10,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2018-11-18 14:00:10,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:10,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:10,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:10,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:10,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:00:10,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:00:10,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:00:10,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:00:10,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:00:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:00:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:00:10,390 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-18 14:00:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:10,476 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-18 14:00:10,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:00:10,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 14:00:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:10,485 INFO L225 Difference]: With dead ends: 35 [2018-11-18 14:00:10,485 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 14:00:10,488 INFO L604 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-11-18 14:00:10,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 14:00:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 14:00:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 14:00:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-18 14:00:10,517 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-18 14:00:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:10,517 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 14:00:10,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:00:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-18 14:00:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 14:00:10,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:10,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:10,519 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:10,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:10,519 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2018-11-18 14:00:10,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:10,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:10,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:10,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:10,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:00:10,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:00:10,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:00:10,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:00:10,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:00:10,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:00:10,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:00:10,566 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-18 14:00:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:10,621 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-18 14:00:10,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:00:10,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 14:00:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:10,622 INFO L225 Difference]: With dead ends: 27 [2018-11-18 14:00:10,622 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 14:00:10,623 INFO L604 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-11-18 14:00:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 14:00:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-18 14:00:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 14:00:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-18 14:00:10,628 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-18 14:00:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:10,628 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 14:00:10,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:00:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-18 14:00:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 14:00:10,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:10,629 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:10,629 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:10,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:10,630 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2018-11-18 14:00:10,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:10,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:10,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:00:10,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:10,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:10,698 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-18 14:00:10,700 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [33], [34], [36], [37], [38], [39], [40], [41] [2018-11-18 14:00:10,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:00:10,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:00:11,373 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:00:11,374 INFO L272 AbstractInterpreter]: Visited 20 different actions 2219 times. Never merged. Widened at 2 different actions 200 times. Performed 4733 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4733 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 220 fixpoints after 3 different actions. Largest state had 5 variables. [2018-11-18 14:00:11,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:11,388 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:00:11,428 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 14:00:11,428 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:00:11,613 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-18 14:00:11,613 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:00:11,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:00:11,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-18 14:00:11,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:00:11,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 14:00:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 14:00:11,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-11-18 14:00:11,615 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 15 states. [2018-11-18 14:00:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:12,330 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2018-11-18 14:00:12,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 14:00:12,330 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-11-18 14:00:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:12,331 INFO L225 Difference]: With dead ends: 65 [2018-11-18 14:00:12,332 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 14:00:12,332 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:00:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 14:00:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-18 14:00:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 14:00:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-18 14:00:12,341 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-11-18 14:00:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:12,341 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-18 14:00:12,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 14:00:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-18 14:00:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 14:00:12,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:12,343 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:12,344 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:12,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:12,344 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 2 times [2018-11-18 14:00:12,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:12,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:12,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:12,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:12,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 14:00:12,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:12,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:12,413 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:00:12,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:00:12,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:12,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:00:12,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:00:12,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:00:12,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 14:00:12,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:00:12,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:00:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-18 14:00:12,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:00:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 14:00:12,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:00:12,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 7 [2018-11-18 14:00:12,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:00:12,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:00:12,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:00:12,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:00:12,681 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2018-11-18 14:00:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:12,733 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2018-11-18 14:00:12,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:00:12,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-18 14:00:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:12,735 INFO L225 Difference]: With dead ends: 82 [2018-11-18 14:00:12,735 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 14:00:12,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:00:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 14:00:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-18 14:00:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 14:00:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-18 14:00:12,743 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 65 [2018-11-18 14:00:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:12,744 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-18 14:00:12,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:00:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-18 14:00:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 14:00:12,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:12,745 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:12,746 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:12,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:12,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1437629917, now seen corresponding path program 1 times [2018-11-18 14:00:12,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:12,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:12,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:00:12,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:12,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 47 proven. 43 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-18 14:00:12,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:12,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:12,856 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-11-18 14:00:12,856 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [33], [34], [36], [37], [38], [39], [40], [41] [2018-11-18 14:00:12,858 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:00:12,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:00:43,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:00:43,845 INFO L272 AbstractInterpreter]: Visited 22 different actions 325248 times. Merged at 8 different actions 104998 times. Widened at 2 different actions 20972 times. Performed 826407 root evaluator evaluations with a maximum evaluation depth of 4. Performed 826407 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 44468 fixpoints after 5 different actions. Largest state had 5 variables. [2018-11-18 14:00:43,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:43,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:00:43,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:43,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/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-11-18 14:00:43,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:43,861 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:00:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:43,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:00:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 84 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 14:00:43,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:00:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 99 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 14:00:44,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:00:44,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 19 [2018-11-18 14:00:44,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:00:44,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 14:00:44,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 14:00:44,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:00:44,227 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 14 states. [2018-11-18 14:00:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:44,497 INFO L93 Difference]: Finished difference Result 145 states and 224 transitions. [2018-11-18 14:00:44,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 14:00:44,498 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-18 14:00:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:44,501 INFO L225 Difference]: With dead ends: 145 [2018-11-18 14:00:44,501 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 14:00:44,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 117 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2018-11-18 14:00:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 14:00:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2018-11-18 14:00:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 14:00:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2018-11-18 14:00:44,514 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 67 [2018-11-18 14:00:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:44,514 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2018-11-18 14:00:44,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 14:00:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2018-11-18 14:00:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 14:00:44,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:44,516 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:44,516 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:44,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:44,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1200034344, now seen corresponding path program 2 times [2018-11-18 14:00:44,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:44,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:44,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:44,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:44,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 59 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-11-18 14:00:44,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:44,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:44,584 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:00:44,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:00:44,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:44,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/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-11-18 14:00:44,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:00:44,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:00:44,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 14:00:44,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:00:44,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:00:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-11-18 14:00:44,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:00:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-11-18 14:00:44,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:00:44,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 12 [2018-11-18 14:00:44,915 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:00:44,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:00:44,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:00:44,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:00:44,916 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand 8 states. [2018-11-18 14:00:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:44,973 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2018-11-18 14:00:44,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:00:44,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-11-18 14:00:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:44,975 INFO L225 Difference]: With dead ends: 97 [2018-11-18 14:00:44,975 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 14:00:44,976 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 212 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-18 14:00:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 14:00:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2018-11-18 14:00:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 14:00:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2018-11-18 14:00:44,987 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 109 [2018-11-18 14:00:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:44,988 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2018-11-18 14:00:44,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:00:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2018-11-18 14:00:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 14:00:44,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:44,990 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:44,990 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:44,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 3 times [2018-11-18 14:00:44,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:44,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:44,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:00:44,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:44,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-11-18 14:00:45,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:45,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:45,077 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:00:45,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:00:45,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:45,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/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-11-18 14:00:45,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:00:45,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 14:00:45,107 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:00:45,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:00:45,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:00:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-18 14:00:45,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:00:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-18 14:00:45,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:00:45,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 13] total 15 [2018-11-18 14:00:45,598 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:00:45,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:00:45,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:00:45,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-18 14:00:45,599 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand 9 states. [2018-11-18 14:00:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:45,680 INFO L93 Difference]: Finished difference Result 114 states and 171 transitions. [2018-11-18 14:00:45,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:00:45,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-11-18 14:00:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:45,681 INFO L225 Difference]: With dead ends: 114 [2018-11-18 14:00:45,682 INFO L226 Difference]: Without dead ends: 95 [2018-11-18 14:00:45,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 259 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-11-18 14:00:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-18 14:00:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2018-11-18 14:00:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 14:00:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2018-11-18 14:00:45,692 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 136 [2018-11-18 14:00:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:45,693 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2018-11-18 14:00:45,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:00:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2018-11-18 14:00:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 14:00:45,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:45,697 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:45,698 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:45,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:45,698 INFO L82 PathProgramCache]: Analyzing trace with hash -509498553, now seen corresponding path program 4 times [2018-11-18 14:00:45,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:45,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:45,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:00:45,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:45,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 669 proven. 122 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-11-18 14:00:45,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:45,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:45,858 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:00:45,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:00:45,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:45,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/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-11-18 14:00:45,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:45,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:00:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:45,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:00:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-11-18 14:00:45,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:00:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 693 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2018-11-18 14:00:46,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:00:46,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 15] total 25 [2018-11-18 14:00:46,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:00:46,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 14:00:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 14:00:46,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-11-18 14:00:46,708 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 18 states. [2018-11-18 14:00:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:47,058 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2018-11-18 14:00:47,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 14:00:47,058 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 204 [2018-11-18 14:00:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:47,059 INFO L225 Difference]: With dead ends: 214 [2018-11-18 14:00:47,059 INFO L226 Difference]: Without dead ends: 132 [2018-11-18 14:00:47,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 387 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=508, Invalid=1562, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 14:00:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-18 14:00:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 116. [2018-11-18 14:00:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-18 14:00:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 159 transitions. [2018-11-18 14:00:47,069 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 159 transitions. Word has length 204 [2018-11-18 14:00:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:47,070 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 159 transitions. [2018-11-18 14:00:47,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 14:00:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 159 transitions. [2018-11-18 14:00:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-18 14:00:47,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:47,074 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:47,074 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:47,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:47,074 INFO L82 PathProgramCache]: Analyzing trace with hash 223191898, now seen corresponding path program 5 times [2018-11-18 14:00:47,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:47,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:47,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 248 proven. 1232 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2018-11-18 14:00:47,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:47,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:47,219 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:00:47,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:00:47,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:47,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/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-11-18 14:00:47,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:00:47,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:00:47,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-18 14:00:47,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:00:47,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:00:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1019 proven. 219 refuted. 0 times theorem prover too weak. 5882 trivial. 0 not checked. [2018-11-18 14:00:47,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:00:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1025 proven. 245 refuted. 0 times theorem prover too weak. 5850 trivial. 0 not checked. [2018-11-18 14:00:48,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:00:48,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 18 [2018-11-18 14:00:48,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:00:48,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 14:00:48,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:00:48,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:00:48,160 INFO L87 Difference]: Start difference. First operand 116 states and 159 transitions. Second operand 12 states. [2018-11-18 14:00:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:48,304 INFO L93 Difference]: Finished difference Result 169 states and 282 transitions. [2018-11-18 14:00:48,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:00:48,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 354 [2018-11-18 14:00:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:48,307 INFO L225 Difference]: With dead ends: 169 [2018-11-18 14:00:48,307 INFO L226 Difference]: Without dead ends: 135 [2018-11-18 14:00:48,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 696 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=216, Invalid=434, Unknown=0, NotChecked=0, Total=650 [2018-11-18 14:00:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-18 14:00:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2018-11-18 14:00:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 14:00:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 137 transitions. [2018-11-18 14:00:48,321 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 137 transitions. Word has length 354 [2018-11-18 14:00:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:48,321 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 137 transitions. [2018-11-18 14:00:48,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 14:00:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2018-11-18 14:00:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1296 [2018-11-18 14:00:48,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:48,355 INFO L375 BasicCegarLoop]: trace histogram [189, 189, 154, 94, 94, 94, 94, 94, 94, 94, 60, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:48,355 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:48,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:48,356 INFO L82 PathProgramCache]: Analyzing trace with hash 934960219, now seen corresponding path program 6 times [2018-11-18 14:00:48,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:48,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:48,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:00:48,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:48,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 100329 backedges. 2594 proven. 7360 refuted. 0 times theorem prover too weak. 90375 trivial. 0 not checked. [2018-11-18 14:00:49,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:49,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:49,012 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:00:49,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:00:49,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:49,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/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-11-18 14:00:49,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:00:49,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 14:00:49,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:00:49,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:00:49,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:00:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 100329 backedges. 1041 proven. 8032 refuted. 0 times theorem prover too weak. 91256 trivial. 0 not checked. [2018-11-18 14:00:49,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:00:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 100329 backedges. 1041 proven. 8132 refuted. 0 times theorem prover too weak. 91156 trivial. 0 not checked. [2018-11-18 14:00:52,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:00:52,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 21] total 31 [2018-11-18 14:00:52,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:00:52,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 14:00:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 14:00:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2018-11-18 14:00:52,820 INFO L87 Difference]: Start difference. First operand 107 states and 137 transitions. Second operand 22 states. [2018-11-18 14:00:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:53,588 INFO L93 Difference]: Finished difference Result 301 states and 527 transitions. [2018-11-18 14:00:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-18 14:00:53,588 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1295 [2018-11-18 14:00:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:53,591 INFO L225 Difference]: With dead ends: 301 [2018-11-18 14:00:53,591 INFO L226 Difference]: Without dead ends: 193 [2018-11-18 14:00:53,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2652 GetRequests, 2560 SyntacticMatches, 19 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1342, Invalid=4208, Unknown=0, NotChecked=0, Total=5550 [2018-11-18 14:00:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-18 14:00:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 173. [2018-11-18 14:00:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 14:00:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 264 transitions. [2018-11-18 14:00:53,607 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 264 transitions. Word has length 1295 [2018-11-18 14:00:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:53,608 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 264 transitions. [2018-11-18 14:00:53,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 14:00:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 264 transitions. [2018-11-18 14:00:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1390 [2018-11-18 14:00:53,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:53,622 INFO L375 BasicCegarLoop]: trace histogram [203, 203, 164, 101, 101, 101, 101, 101, 101, 101, 63, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:53,622 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:53,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:53,623 INFO L82 PathProgramCache]: Analyzing trace with hash -915276830, now seen corresponding path program 7 times [2018-11-18 14:00:53,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:53,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:00:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:53,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 6601 proven. 3548 refuted. 0 times theorem prover too weak. 105429 trivial. 0 not checked. [2018-11-18 14:00:54,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:54,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:54,407 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:00:54,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:00:54,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:54,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/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-11-18 14:00:54,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:54,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:00:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:54,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:00:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 6613 proven. 3528 refuted. 0 times theorem prover too weak. 105437 trivial. 0 not checked. [2018-11-18 14:00:55,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:00:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 6605 proven. 3628 refuted. 0 times theorem prover too weak. 105345 trivial. 0 not checked. [2018-11-18 14:00:58,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:00:58,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 22] total 27 [2018-11-18 14:00:58,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:00:58,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 14:00:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 14:00:58,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2018-11-18 14:00:58,396 INFO L87 Difference]: Start difference. First operand 173 states and 264 transitions. Second operand 17 states. [2018-11-18 14:00:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:00:58,540 INFO L93 Difference]: Finished difference Result 250 states and 470 transitions. [2018-11-18 14:00:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 14:00:58,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1389 [2018-11-18 14:00:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:00:58,546 INFO L225 Difference]: With dead ends: 250 [2018-11-18 14:00:58,546 INFO L226 Difference]: Without dead ends: 202 [2018-11-18 14:00:58,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2808 GetRequests, 2755 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 14:00:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-18 14:00:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-11-18 14:00:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-18 14:00:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 303 transitions. [2018-11-18 14:00:58,559 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 303 transitions. Word has length 1389 [2018-11-18 14:00:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:00:58,561 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 303 transitions. [2018-11-18 14:00:58,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 14:00:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 303 transitions. [2018-11-18 14:00:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-11-18 14:00:58,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:00:58,568 INFO L375 BasicCegarLoop]: trace histogram [187, 187, 151, 93, 93, 93, 93, 93, 93, 93, 58, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:00:58,568 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:00:58,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:00:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1283072366, now seen corresponding path program 8 times [2018-11-18 14:00:58,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:00:58,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:58,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:00:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:00:58,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:00:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:00:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 98001 backedges. 1601 proven. 8691 refuted. 0 times theorem prover too weak. 87709 trivial. 0 not checked. [2018-11-18 14:00:59,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:59,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:00:59,156 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:00:59,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:00:59,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:00:59,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/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-11-18 14:00:59,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:00:59,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:00:59,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-18 14:00:59,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:00:59,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:00:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 98001 backedges. 1619 proven. 8664 refuted. 0 times theorem prover too weak. 87718 trivial. 0 not checked. [2018-11-18 14:00:59,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:01:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 98001 backedges. 1610 proven. 8790 refuted. 0 times theorem prover too weak. 87601 trivial. 0 not checked. [2018-11-18 14:01:03,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:01:03,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 24] total 29 [2018-11-18 14:01:03,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:01:03,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 14:01:03,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 14:01:03,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=583, Unknown=0, NotChecked=0, Total=812 [2018-11-18 14:01:03,240 INFO L87 Difference]: Start difference. First operand 202 states and 303 transitions. Second operand 18 states. [2018-11-18 14:01:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:01:03,407 INFO L93 Difference]: Finished difference Result 283 states and 437 transitions. [2018-11-18 14:01:03,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 14:01:03,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1280 [2018-11-18 14:01:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:01:03,410 INFO L225 Difference]: With dead ends: 283 [2018-11-18 14:01:03,410 INFO L226 Difference]: Without dead ends: 148 [2018-11-18 14:01:03,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2593 GetRequests, 2535 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=481, Invalid=925, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 14:01:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-18 14:01:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-11-18 14:01:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 14:01:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 178 transitions. [2018-11-18 14:01:03,418 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 178 transitions. Word has length 1280 [2018-11-18 14:01:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:01:03,419 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 178 transitions. [2018-11-18 14:01:03,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 14:01:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 178 transitions. [2018-11-18 14:01:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-11-18 14:01:03,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:01:03,425 INFO L375 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:01:03,425 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:01:03,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:01:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 9 times [2018-11-18 14:01:03,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:01:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:01:03,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:01:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:01:03,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:01:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:01:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:01:03,547 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 14:01:03,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:01:03 BoogieIcfgContainer [2018-11-18 14:01:03,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:01:03,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:01:03,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:01:03,621 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:01:03,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:00:10" (3/4) ... [2018-11-18 14:01:03,623 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 14:01:03,719 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_71125882-dfcf-4fc7-ae4e-1bad9fd0b11f/bin-2019/utaipan/witness.graphml [2018-11-18 14:01:03,719 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:01:03,721 INFO L168 Benchmark]: Toolchain (without parser) took 53844.78 ms. Allocated memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 961.9 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-18 14:01:03,721 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:01:03,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.09 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:01:03,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.50 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:01:03,722 INFO L168 Benchmark]: Boogie Preprocessor took 10.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:01:03,722 INFO L168 Benchmark]: RCFGBuilder took 155.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:01:03,722 INFO L168 Benchmark]: TraceAbstraction took 53421.01 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-18 14:01:03,722 INFO L168 Benchmark]: Witness Printer took 98.65 ms. Allocated memory is still 6.1 GB. Free memory is still 2.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:01:03,724 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.09 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.50 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 155.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53421.01 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 98.65 ms. Allocated memory is still 6.1 GB. Free memory is still 2.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] RET return fibo(n-1) + fibo(n-2); [L25] EXPR fibo(x) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 53.3s OverallTime, 13 OverallIterations, 203 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 671 SDslu, 1094 SDs, 0 SdLazy, 1768 SolverSat, 871 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 10080 GetRequests, 9664 SyntacticMatches, 112 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3198 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 31.6s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.6966666666666665 AbsIntWeakeningRatio, 0.56 AbsIntAvgWeakeningVarsNumRemoved, 0.84 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 113 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 11063 NumberOfCodeBlocks, 9687 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 14720 ConstructedInterpolants, 0 QuantifiedInterpolants, 18857741 SizeOfPredicates, 62 NumberOfNonLiveVariables, 7667 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 910522/975399 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...