./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd6d4490a7412402195d3193de0347508566f7c8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 10:42:41,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 10:42:41,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 10:42:41,456 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 10:42:41,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 10:42:41,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 10:42:41,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 10:42:41,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 10:42:41,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 10:42:41,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 10:42:41,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 10:42:41,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 10:42:41,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 10:42:41,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 10:42:41,461 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 10:42:41,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 10:42:41,462 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 10:42:41,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 10:42:41,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 10:42:41,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 10:42:41,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 10:42:41,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 10:42:41,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 10:42:41,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 10:42:41,468 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 10:42:41,468 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 10:42:41,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 10:42:41,469 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 10:42:41,469 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 10:42:41,470 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 10:42:41,470 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 10:42:41,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 10:42:41,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 10:42:41,471 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 10:42:41,471 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 10:42:41,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 10:42:41,472 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 10:42:41,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 10:42:41,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 10:42:41,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 10:42:41,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 10:42:41,483 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 10:42:41,483 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 10:42:41,483 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 10:42:41,483 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 10:42:41,484 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 10:42:41,484 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 10:42:41,484 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 10:42:41,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 10:42:41,484 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 10:42:41,484 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 10:42:41,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 10:42:41,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 10:42:41,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 10:42:41,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 10:42:41,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 10:42:41,485 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 10:42:41,485 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 10:42:41,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 10:42:41,486 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 10:42:41,486 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 10:42:41,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 10:42:41,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 10:42:41,486 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 10:42:41,486 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 10:42:41,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 10:42:41,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 10:42:41,487 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 10:42:41,488 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 10:42:41,488 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd6d4490a7412402195d3193de0347508566f7c8 [2018-12-02 10:42:41,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 10:42:41,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 10:42:41,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 10:42:41,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 10:42:41,520 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 10:42:41,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c [2018-12-02 10:42:41,553 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/data/7524e06fa/21a7f74a524642e08d74f1c39f228706/FLAG25768ea32 [2018-12-02 10:42:41,953 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 10:42:41,953 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/sv-benchmarks/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c [2018-12-02 10:42:41,957 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/data/7524e06fa/21a7f74a524642e08d74f1c39f228706/FLAG25768ea32 [2018-12-02 10:42:41,965 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/data/7524e06fa/21a7f74a524642e08d74f1c39f228706 [2018-12-02 10:42:41,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 10:42:41,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 10:42:41,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 10:42:41,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 10:42:41,971 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 10:42:41,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:42:41" (1/1) ... [2018-12-02 10:42:41,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59facd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:41, skipping insertion in model container [2018-12-02 10:42:41,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:42:41" (1/1) ... [2018-12-02 10:42:41,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 10:42:41,987 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 10:42:42,074 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:42:42,076 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 10:42:42,085 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:42:42,093 INFO L195 MainTranslator]: Completed translation [2018-12-02 10:42:42,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42 WrapperNode [2018-12-02 10:42:42,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 10:42:42,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 10:42:42,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 10:42:42,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 10:42:42,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... [2018-12-02 10:42:42,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... [2018-12-02 10:42:42,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 10:42:42,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 10:42:42,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 10:42:42,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 10:42:42,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... [2018-12-02 10:42:42,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... [2018-12-02 10:42:42,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... [2018-12-02 10:42:42,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... [2018-12-02 10:42:42,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... [2018-12-02 10:42:42,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... [2018-12-02 10:42:42,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... [2018-12-02 10:42:42,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 10:42:42,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 10:42:42,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 10:42:42,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 10:42:42,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 10:42:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 10:42:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-02 10:42:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-02 10:42:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-02 10:42:42,194 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-02 10:42:42,281 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 10:42:42,281 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 10:42:42,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:42:42 BoogieIcfgContainer [2018-12-02 10:42:42,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 10:42:42,281 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 10:42:42,281 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 10:42:42,283 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 10:42:42,284 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 10:42:42,284 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 10:42:41" (1/3) ... [2018-12-02 10:42:42,285 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35705f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:42:42, skipping insertion in model container [2018-12-02 10:42:42,285 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 10:42:42,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:42:42" (2/3) ... [2018-12-02 10:42:42,285 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35705f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:42:42, skipping insertion in model container [2018-12-02 10:42:42,285 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 10:42:42,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:42:42" (3/3) ... [2018-12-02 10:42:42,286 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8_true-unreach-call_true-termination.c [2018-12-02 10:42:42,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 10:42:42,318 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 10:42:42,318 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 10:42:42,318 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 10:42:42,318 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 10:42:42,318 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 10:42:42,318 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 10:42:42,318 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 10:42:42,318 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 10:42:42,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 10:42:42,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 10:42:42,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:42:42,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:42:42,347 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 10:42:42,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:42,347 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 10:42:42,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 10:42:42,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 10:42:42,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:42:42,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:42:42,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 10:42:42,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:42,354 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2018-12-02 10:42:42,354 INFO L796 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2018-12-02 10:42:42,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2018-12-02 10:42:42,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:42,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:42,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:42,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:42,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:42,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2018-12-02 10:42:42,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:42,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:42,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:42,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:42,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2018-12-02 10:42:42,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:42,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:42,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:42,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:42,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:42,534 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:42:42,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:42:42,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:42:42,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:42:42,536 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 10:42:42,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:42:42,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:42:42,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration1_Loop [2018-12-02 10:42:42,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:42:42,537 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:42:42,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,608 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:42:42,608 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,612 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,617 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:42,617 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,635 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:42,635 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,661 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:42,662 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:42,678 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:42,695 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,710 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,712 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:42,712 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,729 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:42,729 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,746 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:42,746 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,763 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:42,763 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:42,778 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 10:42:42,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:42,832 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 10:42:42,833 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:42:42,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:42:42,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:42:42,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:42:42,834 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 10:42:42,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:42,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:42:42,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:42:42,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration1_Loop [2018-12-02 10:42:42,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:42:42,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:42:42,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:42,880 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:42:42,883 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 10:42:42,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:42,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:42,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:42,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:42,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:42,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:42,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:42,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:42,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:42,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:42,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:42,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:42,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:42,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:42,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:42,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:42,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:42,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:42,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:42,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:42,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:42,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:42,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:42,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:42,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:42,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:42,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:42,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:42,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:42,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:42,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:42,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:42,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:42,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:42,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:42,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:42,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:42,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:42,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:42,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:42,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:42,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:42,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:42,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:42,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:42,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:42,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:42,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:42,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:42,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:42,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:42,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:42,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:42,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:42,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:42,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:42,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:42,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:42,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:42,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:42,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:42,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:42,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:42,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:42,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:42,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:42,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:42,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:42,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:42,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:42,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:42,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:42,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:42,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:42,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:42,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:42,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:42,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:42,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:42,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:42,917 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 10:42:42,919 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 10:42:42,920 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 10:42:42,921 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 10:42:42,921 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 10:42:42,921 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 10:42:42,921 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-12-02 10:42:42,922 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 10:42:42,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:42,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:42,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:43,038 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-02 10:42:43,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2018-12-02 10:42:43,168 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2018-12-02 10:42:43,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-02 10:42:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 10:42:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-12-02 10:42:43,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-02 10:42:43,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:43,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-02 10:42:43,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:43,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-12-02 10:42:43,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:43,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2018-12-02 10:42:43,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 10:42:43,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2018-12-02 10:42:43,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-02 10:42:43,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-12-02 10:42:43,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2018-12-02 10:42:43,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 10:42:43,186 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2018-12-02 10:42:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2018-12-02 10:42:43,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-12-02 10:42:43,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 10:42:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2018-12-02 10:42:43,207 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-12-02 10:42:43,207 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-12-02 10:42:43,207 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 10:42:43,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2018-12-02 10:42:43,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 10:42:43,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:42:43,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:42:43,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:43,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:43,209 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2018-12-02 10:42:43,209 INFO L796 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2018-12-02 10:42:43,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:43,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2018-12-02 10:42:43,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:43,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:43,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:43,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:43,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 10:42:43,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:42:43,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:42:43,257 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 10:42:43,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:43,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2018-12-02 10:42:43,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:43,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:43,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:43,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:43,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 10:42:43,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:42:43,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:42:43,293 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 10:42:43,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:42:43,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:42:43,295 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-12-02 10:42:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:42:43,341 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2018-12-02 10:42:43,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 10:42:43,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2018-12-02 10:42:43,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 10:42:43,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2018-12-02 10:42:43,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-12-02 10:42:43,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-12-02 10:42:43,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2018-12-02 10:42:43,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 10:42:43,346 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2018-12-02 10:42:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2018-12-02 10:42:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-12-02 10:42:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 10:42:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2018-12-02 10:42:43,350 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-12-02 10:42:43,350 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-12-02 10:42:43,350 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 10:42:43,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2018-12-02 10:42:43,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 10:42:43,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:42:43,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:42:43,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:43,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:43,352 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 336#L37 call main_#t~ret4 := fibo1(main_~x~0);< 337#fibo1ENTRY ~n := #in~n; 359#L8 assume !(~n < 1); 377#L10 assume !(1 == ~n); 333#L13 call #t~ret0 := fibo2(~n - 1);< 351#fibo2ENTRY ~n := #in~n; 379#L18 assume !(~n < 1); 380#L20 assume !(1 == ~n); 330#L23 call #t~ret2 := fibo1(~n - 1);< 335#fibo1ENTRY ~n := #in~n; 361#L8 assume !(~n < 1); 338#L10 assume 1 == ~n;#res := 1; 339#fibo1FINAL assume true; 355#fibo1EXIT >#45#return; 346#L23-1 [2018-12-02 10:42:43,353 INFO L796 eck$LassoCheckResult]: Loop: 346#L23-1 call #t~ret3 := fibo1(~n - 2);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume !(1 == ~n); 328#L13 call #t~ret0 := fibo2(~n - 1);< 373#fibo2ENTRY ~n := #in~n; 378#L18 assume !(~n < 1); 369#L20 assume !(1 == ~n); 326#L23 call #t~ret2 := fibo1(~n - 1);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume 1 == ~n;#res := 1; 357#fibo1FINAL assume true; 370#fibo1EXIT >#45#return; 346#L23-1 [2018-12-02 10:42:43,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2018-12-02 10:42:43,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:43,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:43,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:43,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:43,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:43,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:42:43,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:42:43,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:43,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:43,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:42:43,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 10:42:43,435 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 10:42:43,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2018-12-02 10:42:43,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:43,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:43,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:43,538 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:42:43,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:42:43,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:42:43,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:42:43,538 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 10:42:43,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:43,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:42:43,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:42:43,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration3_Loop [2018-12-02 10:42:43,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:42:43,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:42:43,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:43,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:43,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:43,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:43,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:43,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:43,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:43,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:43,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:43,578 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:42:43,579 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:43,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:43,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:43,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:43,586 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:43,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:43,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:43,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:43,603 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:43,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:43,617 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:43,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 10:42:43,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:44,295 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 10:42:44,297 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:42:44,297 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:42:44,297 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:42:44,297 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:42:44,297 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 10:42:44,297 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:44,297 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:42:44,297 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:42:44,297 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration3_Loop [2018-12-02 10:42:44,298 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:42:44,298 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:42:44,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:44,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:44,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:44,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:44,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:44,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:44,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:44,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:44,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:44,349 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:42:44,349 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 10:42:44,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:44,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:44,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:44,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:44,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:44,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:44,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:44,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:44,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:44,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:44,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:44,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:44,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:44,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:44,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:44,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:44,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:44,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:44,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:44,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:44,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:44,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:44,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:44,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:44,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:44,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:44,358 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 10:42:44,360 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 10:42:44,361 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 10:42:44,361 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 10:42:44,361 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 10:42:44,361 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 10:42:44,361 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-12-02 10:42:44,361 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 10:42:44,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:44,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:44,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:44,479 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-12-02 10:42:44,479 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-12-02 10:42:44,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 190 states and 262 transitions. Complement of second has 26 states. [2018-12-02 10:42:44,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-02 10:42:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 10:42:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-12-02 10:42:44,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2018-12-02 10:42:44,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:44,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2018-12-02 10:42:44,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:44,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2018-12-02 10:42:44,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:44,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2018-12-02 10:42:44,659 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-02 10:42:44,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2018-12-02 10:42:44,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-12-02 10:42:44,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-12-02 10:42:44,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2018-12-02 10:42:44,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 10:42:44,665 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2018-12-02 10:42:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2018-12-02 10:42:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2018-12-02 10:42:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-02 10:42:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2018-12-02 10:42:44,676 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2018-12-02 10:42:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 10:42:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 10:42:44,677 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2018-12-02 10:42:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:42:44,756 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2018-12-02 10:42:44,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 10:42:44,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2018-12-02 10:42:44,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-02 10:42:44,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2018-12-02 10:42:44,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-12-02 10:42:44,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-12-02 10:42:44,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2018-12-02 10:42:44,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 10:42:44,762 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2018-12-02 10:42:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2018-12-02 10:42:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2018-12-02 10:42:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-02 10:42:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2018-12-02 10:42:44,770 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-12-02 10:42:44,770 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-12-02 10:42:44,770 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 10:42:44,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2018-12-02 10:42:44,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-02 10:42:44,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:42:44,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:42:44,773 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-02 10:42:44,773 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-02 10:42:44,774 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1131#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1132#fibo1ENTRY ~n := #in~n; 1202#L8 assume !(~n < 1); 1200#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1143#fibo2ENTRY ~n := #in~n; 1161#L18 assume !(~n < 1); 1167#L20 assume !(1 == ~n); 1147#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume !(~n < 1); 1199#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume ~n < 1;#res := 0; 1125#fibo2FINAL assume true; 1126#fibo2EXIT >#49#return; 1112#L13-1 call #t~ret1 := fibo2(~n - 2);< 1148#fibo2ENTRY ~n := #in~n; 1169#L18 assume !(~n < 1); 1170#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1196#L8 assume !(~n < 1); 1205#L10 assume 1 == ~n;#res := 1; 1206#fibo1FINAL assume true; 1201#fibo1EXIT >#45#return; 1186#L23-1 call #t~ret3 := fibo1(~n - 2);< 1130#fibo1ENTRY ~n := #in~n; 1195#L8 assume !(~n < 1); 1193#L10 assume !(1 == ~n); 1129#L13 call #t~ret0 := fibo2(~n - 1);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1187#fibo2EXIT >#49#return; 1128#L13-1 call #t~ret1 := fibo2(~n - 2);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume !(~n < 1); 1176#L20 assume 1 == ~n;#res := 1; 1177#fibo2FINAL assume true; 1162#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-12-02 10:42:44,774 INFO L796 eck$LassoCheckResult]: Loop: 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-12-02 10:42:44,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:44,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2018-12-02 10:42:44,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:44,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:44,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:44,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:44,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-12-02 10:42:44,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:42:44,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:42:44,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:44,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-12-02 10:42:44,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:42:44,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 16 [2018-12-02 10:42:44,939 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 10:42:44,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:44,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2018-12-02 10:42:44,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:44,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:44,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:44,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:44,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-02 10:42:44,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:42:44,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:42:44,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:44,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 10:42:45,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 10:42:45,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-12-02 10:42:45,018 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 10:42:45,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:42:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:42:45,019 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-12-02 10:42:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:42:45,044 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2018-12-02 10:42:45,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 10:42:45,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2018-12-02 10:42:45,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-02 10:42:45,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2018-12-02 10:42:45,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-12-02 10:42:45,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-12-02 10:42:45,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2018-12-02 10:42:45,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 10:42:45,050 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2018-12-02 10:42:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2018-12-02 10:42:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2018-12-02 10:42:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-02 10:42:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2018-12-02 10:42:45,059 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-12-02 10:42:45,060 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-12-02 10:42:45,060 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 10:42:45,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2018-12-02 10:42:45,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-02 10:42:45,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:42:45,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:42:45,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-12-02 10:42:45,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:45,063 INFO L794 eck$LassoCheckResult]: Stem: 1915#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1878#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1884#fibo1ENTRY ~n := #in~n; 1921#L8 assume !(~n < 1); 1877#L10 assume !(1 == ~n); 1879#L13 call #t~ret0 := fibo2(~n - 1);< 1898#fibo2ENTRY ~n := #in~n; 1919#L18 assume !(~n < 1); 1992#L20 assume !(1 == ~n); 1903#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1944#L10 assume !(1 == ~n); 1867#L13 call #t~ret0 := fibo2(~n - 1);< 1942#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1957#L20 assume !(1 == ~n); 1866#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1944#L10 assume !(1 == ~n); 1867#L13 call #t~ret0 := fibo2(~n - 1);< 1942#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1957#L20 assume 1 == ~n;#res := 1; 1872#fibo2FINAL assume true; 1873#fibo2EXIT >#49#return; 1868#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1925#L18 assume !(~n < 1); 1923#L20 assume !(1 == ~n); 1866#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1946#L8 assume !(~n < 1); 1953#L10 assume 1 == ~n;#res := 1; 1954#fibo1FINAL assume true; 1947#fibo1EXIT >#45#return; 1875#L23-1 call #t~ret3 := fibo1(~n - 2);< 1883#fibo1ENTRY ~n := #in~n; 1943#L8 assume !(~n < 1); 1940#L10 assume !(1 == ~n); 1882#L13 call #t~ret0 := fibo2(~n - 1);< 1936#fibo2ENTRY ~n := #in~n; 1934#L18 assume !(~n < 1); 1929#L20 assume 1 == ~n;#res := 1; 1930#fibo2FINAL assume true; 1920#fibo2EXIT >#49#return; 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume ~n < 1;#res := 0; 1996#fibo2FINAL assume true; 1999#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#47#return; 1988#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1978#fibo2FINAL assume true; 1972#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#45#return; 1975#L23-1 call #t~ret3 := fibo1(~n - 2);< 1985#fibo1ENTRY ~n := #in~n; 1983#L8 assume !(~n < 1); 1980#L10 assume !(1 == ~n); 1917#L13 call #t~ret0 := fibo2(~n - 1);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume 1 == ~n;#res := 1; 1995#fibo2FINAL assume true; 1987#fibo2EXIT >#49#return; 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume ~n < 1;#res := 0; 1996#fibo2FINAL assume true; 1999#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#47#return; 1988#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1978#fibo2FINAL assume true; 1972#fibo2EXIT >#49#return; 1916#L13-1 [2018-12-02 10:42:45,063 INFO L796 eck$LassoCheckResult]: Loop: 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume !(1 == ~n); 1977#L23 call #t~ret2 := fibo1(~n - 1);< 1985#fibo1ENTRY ~n := #in~n; 1983#L8 assume !(~n < 1); 1980#L10 assume !(1 == ~n); 1917#L13 call #t~ret0 := fibo2(~n - 1);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume 1 == ~n;#res := 1; 1995#fibo2FINAL assume true; 1987#fibo2EXIT >#49#return; 1916#L13-1 [2018-12-02 10:42:45,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:45,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2018-12-02 10:42:45,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:45,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:45,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:45,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:45,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-12-02 10:42:45,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:42:45,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:42:45,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 10:42:45,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 10:42:45,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 10:42:45,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 10:42:45,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:42:45,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 17 [2018-12-02 10:42:45,264 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 10:42:45,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2018-12-02 10:42:45,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:45,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:45,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:45,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:42:45,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:45,348 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:42:45,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:42:45,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:42:45,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:42:45,349 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 10:42:45,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:45,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:42:45,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:42:45,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration5_Loop [2018-12-02 10:42:45,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:42:45,349 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:42:45,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:45,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:45,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:45,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:45,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:45,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:45,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:45,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:45,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:45,386 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:42:45,386 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:45,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:45,389 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:45,391 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:45,391 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=1} Honda state: {fibo1_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:45,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:45,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:45,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:45,407 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:45,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:45,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:45,424 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:45,424 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:45,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:45,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:45,441 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:45,441 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:45,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:45,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:45,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:45,458 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:45,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:45,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:45,476 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:45,476 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:45,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:45,491 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:45,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 10:42:45,508 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:46,587 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 10:42:46,589 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:42:46,589 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:42:46,589 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:42:46,589 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:42:46,589 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 10:42:46,589 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:46,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:42:46,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:42:46,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration5_Loop [2018-12-02 10:42:46,590 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:42:46,590 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:42:46,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:46,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:46,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:46,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:46,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:46,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:46,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:46,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:46,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:46,658 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:42:46,658 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 10:42:46,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:46,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:46,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:46,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:46,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:46,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:46,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:46,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:46,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:46,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:46,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:46,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:46,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:46,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:46,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:46,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:46,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:46,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:46,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:46,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:46,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:46,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:46,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:46,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:46,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:46,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:46,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:46,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:46,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:46,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:46,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:46,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:46,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:46,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:46,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:46,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:46,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:46,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:46,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:46,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:46,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:46,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:46,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:46,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:46,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:46,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:46,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:46,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:46,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:46,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:46,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:46,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:46,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:46,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:46,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:46,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:46,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:46,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:46,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:46,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:46,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:46,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:46,673 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 10:42:46,676 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 10:42:46,676 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 10:42:46,676 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 10:42:46,676 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 10:42:46,676 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 10:42:46,676 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-12-02 10:42:46,677 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 10:42:46,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:46,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:46,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:46,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-12-02 10:42:46,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-12-02 10:42:46,999 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 879 states and 1167 transitions. Complement of second has 26 states. [2018-12-02 10:42:46,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-02 10:42:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 10:42:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-12-02 10:42:47,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2018-12-02 10:42:47,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:47,001 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 10:42:47,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:47,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:47,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:47,165 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-12-02 10:42:47,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-12-02 10:42:47,306 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 669 states and 942 transitions. Complement of second has 24 states. [2018-12-02 10:42:47,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-02 10:42:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 10:42:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-12-02 10:42:47,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2018-12-02 10:42:47,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:47,308 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 10:42:47,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:47,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:47,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:47,440 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-12-02 10:42:47,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-12-02 10:42:47,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 1660 states and 2156 transitions. Complement of second has 90 states. [2018-12-02 10:42:47,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-02 10:42:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 10:42:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-12-02 10:42:47,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2018-12-02 10:42:47,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:47,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2018-12-02 10:42:47,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:47,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2018-12-02 10:42:47,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:47,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2018-12-02 10:42:47,614 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-12-02 10:42:47,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2018-12-02 10:42:47,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2018-12-02 10:42:47,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2018-12-02 10:42:47,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2018-12-02 10:42:47,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 10:42:47,624 INFO L705 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2018-12-02 10:42:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2018-12-02 10:42:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2018-12-02 10:42:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-12-02 10:42:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2018-12-02 10:42:47,649 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2018-12-02 10:42:47,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 10:42:47,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:42:47,649 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 17 states. [2018-12-02 10:42:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:42:47,909 INFO L93 Difference]: Finished difference Result 416 states and 562 transitions. [2018-12-02 10:42:47,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 10:42:47,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 562 transitions. [2018-12-02 10:42:47,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-02 10:42:47,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 367 states and 504 transitions. [2018-12-02 10:42:47,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-12-02 10:42:47,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2018-12-02 10:42:47,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 504 transitions. [2018-12-02 10:42:47,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 10:42:47,918 INFO L705 BuchiCegarLoop]: Abstraction has 367 states and 504 transitions. [2018-12-02 10:42:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 504 transitions. [2018-12-02 10:42:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 332. [2018-12-02 10:42:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-12-02 10:42:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 444 transitions. [2018-12-02 10:42:47,927 INFO L728 BuchiCegarLoop]: Abstraction has 332 states and 444 transitions. [2018-12-02 10:42:47,927 INFO L608 BuchiCegarLoop]: Abstraction has 332 states and 444 transitions. [2018-12-02 10:42:47,927 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 10:42:47,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 444 transitions. [2018-12-02 10:42:47,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-02 10:42:47,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:42:47,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:42:47,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:47,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2018-12-02 10:42:47,931 INFO L794 eck$LassoCheckResult]: Stem: 8098#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8064#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8065#fibo1ENTRY ~n := #in~n; 8160#L8 assume !(~n < 1); 8155#L10 assume !(1 == ~n); 8135#L13 call #t~ret0 := fibo2(~n - 1);< 8152#fibo2ENTRY ~n := #in~n; 8169#L18 assume !(~n < 1); 8134#L20 assume !(1 == ~n); 8136#L23 call #t~ret2 := fibo1(~n - 1);< 8164#fibo1ENTRY ~n := #in~n; 8161#L8 assume !(~n < 1); 8156#L10 assume !(1 == ~n); 8035#L13 call #t~ret0 := fibo2(~n - 1);< 8143#fibo2ENTRY ~n := #in~n; 8137#L18 assume !(~n < 1); 8138#L20 assume !(1 == ~n); 8034#L23 call #t~ret2 := fibo1(~n - 1);< 8037#fibo1ENTRY ~n := #in~n; 8162#L8 assume !(~n < 1); 8157#L10 assume !(1 == ~n); 8036#L13 call #t~ret0 := fibo2(~n - 1);< 8143#fibo2ENTRY ~n := #in~n; 8137#L18 assume !(~n < 1); 8138#L20 assume !(1 == ~n); 8034#L23 call #t~ret2 := fibo1(~n - 1);< 8037#fibo1ENTRY ~n := #in~n; 8165#L8 assume !(~n < 1); 8296#L10 assume 1 == ~n;#res := 1; 8292#fibo1FINAL assume true; 8206#fibo1EXIT >#45#return; 8202#L23-1 call #t~ret3 := fibo1(~n - 2);< 8203#fibo1ENTRY ~n := #in~n; 8208#L8 assume ~n < 1;#res := 0; 8205#fibo1FINAL assume true; 8201#fibo1EXIT >#47#return; 8199#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8198#fibo2FINAL assume true; 8194#fibo2EXIT >#49#return; 8129#L13-1 [2018-12-02 10:42:47,931 INFO L796 eck$LassoCheckResult]: Loop: 8129#L13-1 call #t~ret1 := fibo2(~n - 2);< 8092#fibo2ENTRY ~n := #in~n; 8131#L18 assume !(~n < 1); 8130#L20 assume !(1 == ~n); 8091#L23 call #t~ret2 := fibo1(~n - 1);< 8126#fibo1ENTRY ~n := #in~n; 8125#L8 assume !(~n < 1); 8121#L10 assume !(1 == ~n); 8123#L13 call #t~ret0 := fibo2(~n - 1);< 8196#fibo2ENTRY ~n := #in~n; 8246#L18 assume !(~n < 1); 8245#L20 assume !(1 == ~n); 8084#L23 call #t~ret2 := fibo1(~n - 1);< 8262#fibo1ENTRY ~n := #in~n; 8312#L8 assume !(~n < 1); 8313#L10 assume 1 == ~n;#res := 1; 8048#fibo1FINAL assume true; 8338#fibo1EXIT >#45#return; 8045#L23-1 call #t~ret3 := fibo1(~n - 2);< 8060#fibo1ENTRY ~n := #in~n; 8324#L8 assume ~n < 1;#res := 0; 8311#fibo1FINAL assume true; 8255#fibo1EXIT >#47#return; 8251#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8248#fibo2FINAL assume true; 8195#fibo2EXIT >#49#return; 8187#L13-1 call #t~ret1 := fibo2(~n - 2);< 8188#fibo2ENTRY ~n := #in~n; 8247#L18 assume ~n < 1;#res := 0; 8241#fibo2FINAL assume true; 8238#fibo2EXIT >#51#return; 8181#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8177#fibo1FINAL assume true; 8174#fibo1EXIT >#45#return; 8149#L23-1 call #t~ret3 := fibo1(~n - 2);< 8163#fibo1ENTRY ~n := #in~n; 8158#L8 assume !(~n < 1); 8153#L10 assume !(1 == ~n); 8145#L13 call #t~ret0 := fibo2(~n - 1);< 8151#fibo2ENTRY ~n := #in~n; 8168#L18 assume !(~n < 1); 8166#L20 assume !(1 == ~n); 8150#L23 call #t~ret2 := fibo1(~n - 1);< 8163#fibo1ENTRY ~n := #in~n; 8158#L8 assume !(~n < 1); 8153#L10 assume !(1 == ~n); 8145#L13 call #t~ret0 := fibo2(~n - 1);< 8151#fibo2ENTRY ~n := #in~n; 8168#L18 assume !(~n < 1); 8166#L20 assume 1 == ~n;#res := 1; 8167#fibo2FINAL assume true; 8220#fibo2EXIT >#49#return; 8215#L13-1 call #t~ret1 := fibo2(~n - 2);< 8216#fibo2ENTRY ~n := #in~n; 8232#L18 assume ~n < 1;#res := 0; 8219#fibo2FINAL assume true; 8214#fibo2EXIT >#51#return; 8213#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8210#fibo1FINAL assume true; 8207#fibo1EXIT >#45#return; 8192#L23-1 call #t~ret3 := fibo1(~n - 2);< 8197#fibo1ENTRY ~n := #in~n; 8225#L8 assume !(~n < 1); 8217#L10 assume !(1 == ~n); 8218#L13 call #t~ret0 := fibo2(~n - 1);< 8224#fibo2ENTRY ~n := #in~n; 8235#L18 assume !(~n < 1); 8233#L20 assume 1 == ~n;#res := 1; 8167#fibo2FINAL assume true; 8220#fibo2EXIT >#49#return; 8215#L13-1 call #t~ret1 := fibo2(~n - 2);< 8216#fibo2ENTRY ~n := #in~n; 8232#L18 assume ~n < 1;#res := 0; 8219#fibo2FINAL assume true; 8214#fibo2EXIT >#51#return; 8213#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8210#fibo1FINAL assume true; 8207#fibo1EXIT >#47#return; 8193#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8189#fibo2FINAL assume true; 8144#fibo2EXIT >#49#return; 8129#L13-1 [2018-12-02 10:42:47,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:47,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1646893086, now seen corresponding path program 1 times [2018-12-02 10:42:47,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:47,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:47,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:47,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:47,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 10:42:48,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:42:48,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:42:48,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:48,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 10:42:48,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:42:48,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-12-02 10:42:48,078 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 10:42:48,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1570424754, now seen corresponding path program 1 times [2018-12-02 10:42:48,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:48,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:48,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 19 proven. 56 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-02 10:42:48,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:42:48,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:42:48,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:48,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 109 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-02 10:42:48,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:42:48,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-02 10:42:48,214 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 10:42:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 10:42:48,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:42:48,214 INFO L87 Difference]: Start difference. First operand 332 states and 444 transitions. cyclomatic complexity: 116 Second operand 17 states. [2018-12-02 10:42:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:42:48,429 INFO L93 Difference]: Finished difference Result 418 states and 600 transitions. [2018-12-02 10:42:48,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 10:42:48,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 600 transitions. [2018-12-02 10:42:48,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-02 10:42:48,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 415 states and 596 transitions. [2018-12-02 10:42:48,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2018-12-02 10:42:48,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2018-12-02 10:42:48,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 596 transitions. [2018-12-02 10:42:48,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 10:42:48,434 INFO L705 BuchiCegarLoop]: Abstraction has 415 states and 596 transitions. [2018-12-02 10:42:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 596 transitions. [2018-12-02 10:42:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 393. [2018-12-02 10:42:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-02 10:42:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 558 transitions. [2018-12-02 10:42:48,442 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 558 transitions. [2018-12-02 10:42:48,442 INFO L608 BuchiCegarLoop]: Abstraction has 393 states and 558 transitions. [2018-12-02 10:42:48,443 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 10:42:48,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 393 states and 558 transitions. [2018-12-02 10:42:48,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-02 10:42:48,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:42:48,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:42:48,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:48,445 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 10, 9, 9, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 1] [2018-12-02 10:42:48,446 INFO L794 eck$LassoCheckResult]: Stem: 9227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 9189#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9190#fibo1ENTRY ~n := #in~n; 9381#L8 assume !(~n < 1); 9366#L10 assume !(1 == ~n); 9367#L13 call #t~ret0 := fibo2(~n - 1);< 9379#fibo2ENTRY ~n := #in~n; 9378#L18 assume !(~n < 1); 9377#L20 assume !(1 == ~n); 9214#L23 call #t~ret2 := fibo1(~n - 1);< 9232#fibo1ENTRY ~n := #in~n; 9233#L8 assume !(~n < 1); 9239#L10 assume !(1 == ~n); 9213#L13 call #t~ret0 := fibo2(~n - 1);< 9215#fibo2ENTRY ~n := #in~n; 9235#L18 assume !(~n < 1); 9242#L20 assume !(1 == ~n); 9243#L23 call #t~ret2 := fibo1(~n - 1);< 9396#fibo1ENTRY ~n := #in~n; 9458#L8 assume !(~n < 1); 9457#L10 assume !(1 == ~n); 9187#L13 call #t~ret0 := fibo2(~n - 1);< 9363#fibo2ENTRY ~n := #in~n; 9530#L18 assume !(~n < 1); 9529#L20 assume !(1 == ~n); 9185#L23 call #t~ret2 := fibo1(~n - 1);< 9188#fibo1ENTRY ~n := #in~n; 9373#L8 assume !(~n < 1); 9194#L10 assume !(1 == ~n); 9186#L13 call #t~ret0 := fibo2(~n - 1);< 9363#fibo2ENTRY ~n := #in~n; 9530#L18 assume !(~n < 1); 9529#L20 assume !(1 == ~n); 9185#L23 call #t~ret2 := fibo1(~n - 1);< 9188#fibo1ENTRY ~n := #in~n; 9376#L8 assume !(~n < 1); 9482#L10 assume 1 == ~n;#res := 1; 9483#fibo1FINAL assume true; 9494#fibo1EXIT >#45#return; 9415#L23-1 call #t~ret3 := fibo1(~n - 2);< 9469#fibo1ENTRY ~n := #in~n; 9471#L8 assume ~n < 1;#res := 0; 9470#fibo1FINAL assume true; 9467#fibo1EXIT >#47#return; 9465#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 9461#fibo2FINAL assume true; 9362#fibo2EXIT >#49#return; 9297#L13-1 [2018-12-02 10:42:48,446 INFO L796 eck$LassoCheckResult]: Loop: 9297#L13-1 call #t~ret1 := fibo2(~n - 2);< 9222#fibo2ENTRY ~n := #in~n; 9401#L18 assume !(~n < 1); 9299#L20 assume !(1 == ~n); 9221#L23 call #t~ret2 := fibo1(~n - 1);< 9290#fibo1ENTRY ~n := #in~n; 9291#L8 assume !(~n < 1); 9445#L10 assume !(1 == ~n); 9198#L13 call #t~ret0 := fibo2(~n - 1);< 9277#fibo2ENTRY ~n := #in~n; 9323#L18 assume !(~n < 1); 9320#L20 assume !(1 == ~n); 9256#L23 call #t~ret2 := fibo1(~n - 1);< 9274#fibo1ENTRY ~n := #in~n; 9272#L8 assume !(~n < 1); 9270#L10 assume 1 == ~n;#res := 1; 9271#fibo1FINAL assume true; 9326#fibo1EXIT >#45#return; 9203#L23-1 call #t~ret3 := fibo1(~n - 2);< 9204#fibo1ENTRY ~n := #in~n; 9329#L8 assume ~n < 1;#res := 0; 9273#fibo1FINAL assume true; 9310#fibo1EXIT >#47#return; 9206#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 9197#fibo2FINAL assume true; 9200#fibo2EXIT >#49#return; 9220#L13-1 call #t~ret1 := fibo2(~n - 2);< 9222#fibo2ENTRY ~n := #in~n; 9401#L18 assume !(~n < 1); 9299#L20 assume !(1 == ~n); 9221#L23 call #t~ret2 := fibo1(~n - 1);< 9290#fibo1ENTRY ~n := #in~n; 9291#L8 assume !(~n < 1); 9445#L10 assume 1 == ~n;#res := 1; 9446#fibo1FINAL assume true; 9486#fibo1EXIT >#45#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9419#fibo1ENTRY ~n := #in~n; 9491#L8 assume !(~n < 1); 9488#L10 assume !(1 == ~n); 9442#L13 call #t~ret0 := fibo2(~n - 1);< 9444#fibo2ENTRY ~n := #in~n; 9463#L18 assume !(~n < 1); 9459#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9412#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 9385#fibo2FINAL assume true; 9357#fibo2EXIT >#51#return; 9361#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9523#fibo1FINAL assume true; 9392#fibo1EXIT >#45#return; 9369#L23-1 call #t~ret3 := fibo1(~n - 2);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume !(1 == ~n); 9370#L23 call #t~ret2 := fibo1(~n - 1);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume !(1 == ~n); 9370#L23 call #t~ret2 := fibo1(~n - 1);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume 1 == ~n;#res := 1; 9372#fibo1FINAL assume true; 9487#fibo1EXIT >#45#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9419#fibo1ENTRY ~n := #in~n; 9491#L8 assume !(~n < 1); 9488#L10 assume !(1 == ~n); 9442#L13 call #t~ret0 := fibo2(~n - 1);< 9444#fibo2ENTRY ~n := #in~n; 9463#L18 assume !(~n < 1); 9459#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9412#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 9385#fibo2FINAL assume true; 9357#fibo2EXIT >#49#return; 9297#L13-1 call #t~ret1 := fibo2(~n - 2);< 9386#fibo2ENTRY ~n := #in~n; 9449#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9431#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9528#fibo1FINAL assume true; 9395#fibo1EXIT >#45#return; 9369#L23-1 call #t~ret3 := fibo1(~n - 2);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9393#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 9405#fibo2FINAL assume true; 9403#fibo2EXIT >#49#return; 9297#L13-1 [2018-12-02 10:42:48,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1138675049, now seen corresponding path program 2 times [2018-12-02 10:42:48,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:48,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:48,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 10:42:48,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:42:48,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:42:48,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 10:42:48,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 10:42:48,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 10:42:48,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 10:42:48,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:42:48,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 22 [2018-12-02 10:42:48,669 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 10:42:48,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1600037258, now seen corresponding path program 2 times [2018-12-02 10:42:48,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:48,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:48,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:48,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:42:48,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 56 proven. 91 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-12-02 10:42:48,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:42:48,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:42:48,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 10:42:48,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 10:42:48,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 10:42:48,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 302 proven. 29 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 10:42:48,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:42:48,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2018-12-02 10:42:48,850 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 10:42:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 10:42:48,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-12-02 10:42:48,851 INFO L87 Difference]: Start difference. First operand 393 states and 558 transitions. cyclomatic complexity: 169 Second operand 23 states. [2018-12-02 10:42:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:42:49,124 INFO L93 Difference]: Finished difference Result 503 states and 668 transitions. [2018-12-02 10:42:49,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 10:42:49,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 668 transitions. [2018-12-02 10:42:49,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-02 10:42:49,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 453 states and 591 transitions. [2018-12-02 10:42:49,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2018-12-02 10:42:49,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2018-12-02 10:42:49,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 453 states and 591 transitions. [2018-12-02 10:42:49,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 10:42:49,130 INFO L705 BuchiCegarLoop]: Abstraction has 453 states and 591 transitions. [2018-12-02 10:42:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states and 591 transitions. [2018-12-02 10:42:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 427. [2018-12-02 10:42:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-12-02 10:42:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 550 transitions. [2018-12-02 10:42:49,136 INFO L728 BuchiCegarLoop]: Abstraction has 427 states and 550 transitions. [2018-12-02 10:42:49,136 INFO L608 BuchiCegarLoop]: Abstraction has 427 states and 550 transitions. [2018-12-02 10:42:49,136 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 10:42:49,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 427 states and 550 transitions. [2018-12-02 10:42:49,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-02 10:42:49,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:42:49,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:42:49,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:49,138 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:42:49,138 INFO L794 eck$LassoCheckResult]: Stem: 10746#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10714#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10715#fibo1ENTRY ~n := #in~n; 10842#L8 assume !(~n < 1); 10838#L10 assume !(1 == ~n); 10833#L13 call #t~ret0 := fibo2(~n - 1);< 10834#fibo2ENTRY ~n := #in~n; 10847#L18 assume !(~n < 1); 10846#L20 assume !(1 == ~n); 10844#L23 call #t~ret2 := fibo1(~n - 1);< 10845#fibo1ENTRY ~n := #in~n; 10858#L8 assume !(~n < 1); 10857#L10 assume !(1 == ~n); 10855#L13 call #t~ret0 := fibo2(~n - 1);< 10856#fibo2ENTRY ~n := #in~n; 10871#L18 assume !(~n < 1); 10870#L20 assume !(1 == ~n); 10868#L23 call #t~ret2 := fibo1(~n - 1);< 10869#fibo1ENTRY ~n := #in~n; 10981#L8 assume !(~n < 1); 10979#L10 assume !(1 == ~n); 10975#L13 call #t~ret0 := fibo2(~n - 1);< 10977#fibo2ENTRY ~n := #in~n; 11047#L18 assume !(~n < 1); 11046#L20 assume !(1 == ~n); 10992#L23 call #t~ret2 := fibo1(~n - 1);< 10993#fibo1ENTRY ~n := #in~n; 11053#L8 assume !(~n < 1); 11050#L10 assume !(1 == ~n); 11008#L13 call #t~ret0 := fibo2(~n - 1);< 11009#fibo2ENTRY ~n := #in~n; 11014#L18 assume !(~n < 1); 11013#L20 assume 1 == ~n;#res := 1; 11012#fibo2FINAL assume true; 11007#fibo2EXIT >#49#return; 11001#L13-1 call #t~ret1 := fibo2(~n - 2);< 11002#fibo2ENTRY ~n := #in~n; 11025#L18 assume ~n < 1;#res := 0; 11024#fibo2FINAL assume true; 11000#fibo2EXIT >#51#return; 10998#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 10997#fibo1FINAL assume true; 10991#fibo1EXIT >#45#return; 10926#L23-1 call #t~ret3 := fibo1(~n - 2);< 10988#fibo1ENTRY ~n := #in~n; 11027#L8 assume ~n < 1;#res := 0; 11026#fibo1FINAL assume true; 10986#fibo1EXIT >#47#return; 10985#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10984#fibo2FINAL assume true; 10976#fibo2EXIT >#49#return; 10918#L13-1 call #t~ret1 := fibo2(~n - 2);< 10931#fibo2ENTRY ~n := #in~n; 10932#L18 assume ~n < 1;#res := 0; 10925#fibo2FINAL assume true; 10914#fibo2EXIT >#51#return; 10921#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11058#fibo1FINAL assume true; 10867#fibo1EXIT >#45#return; 10862#L23-1 call #t~ret3 := fibo1(~n - 2);< 10866#fibo1ENTRY ~n := #in~n; 10996#L8 assume !(~n < 1); 10994#L10 assume !(1 == ~n); 10957#L13 call #t~ret0 := fibo2(~n - 1);< 10990#fibo2ENTRY [2018-12-02 10:42:49,138 INFO L796 eck$LassoCheckResult]: Loop: 10990#fibo2ENTRY ~n := #in~n; 11054#L18 assume !(~n < 1); 11051#L20 assume !(1 == ~n); 10929#L23 call #t~ret2 := fibo1(~n - 1);< 11017#fibo1ENTRY ~n := #in~n; 11057#L8 assume !(~n < 1); 11055#L10 assume !(1 == ~n); 10956#L13 call #t~ret0 := fibo2(~n - 1);< 10990#fibo2ENTRY [2018-12-02 10:42:49,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1911557610, now seen corresponding path program 1 times [2018-12-02 10:42:49,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:49,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:49,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:49,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:42:49,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 10:42:49,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:42:49,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:42:49,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:49,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 30 proven. 61 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 10:42:49,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:42:49,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 21 [2018-12-02 10:42:49,313 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 10:42:49,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:49,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1606542952, now seen corresponding path program 2 times [2018-12-02 10:42:49,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:42:49,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:42:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:49,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:42:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:42:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:42:49,357 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:42:49,357 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:42:49,357 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:42:49,357 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:42:49,358 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 10:42:49,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:42:49,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:42:49,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration8_Loop [2018-12-02 10:42:49,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:42:49,358 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:42:49,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,392 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:42:49,392 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:49,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:49,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:49,395 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,410 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:49,410 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:49,412 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:49,412 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:49,427 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:49,429 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:49,429 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:49,444 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:49,446 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:49,446 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:49,460 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:49,462 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:49,462 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:49,476 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:49,478 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:49,478 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,493 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:49,493 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:49,494 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:49,494 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:49,508 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:49,510 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:42:49,510 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:42:49,525 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_798fb00e-d282-4b5a-bcf1-a905eafbc3ae/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 10:42:49,541 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:42:49,556 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 10:42:49,557 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:42:49,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:42:49,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:42:49,557 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:42:49,557 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 10:42:49,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:42:49,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:42:49,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:42:49,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration8_Loop [2018-12-02 10:42:49,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:42:49,557 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:42:49,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:42:49,595 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:42:49,595 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 10:42:49,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:49,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:49,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:49,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:49,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:49,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:49,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:49,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:49,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:49,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:49,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:49,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:49,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:49,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:49,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:49,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:49,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:49,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:49,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:49,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:49,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:49,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:49,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:49,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:49,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:49,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:49,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:49,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:49,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:49,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:49,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:49,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:49,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:49,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:49,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:49,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:49,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:49,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:49,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:49,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:49,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:49,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:49,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:49,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:49,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:49,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:49,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:49,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:49,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:49,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:49,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:49,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:49,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:49,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:49,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:49,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:49,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:49,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:49,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:49,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:49,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:49,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:49,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:49,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:49,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:49,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:49,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:49,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:49,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:49,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:49,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:49,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:42:49,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:42:49,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:42:49,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:42:49,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:42:49,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:42:49,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:42:49,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:42:49,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:42:49,606 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 10:42:49,607 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 10:42:49,607 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 10:42:49,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 10:42:49,607 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 10:42:49,607 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 10:42:49,607 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2018-12-02 10:42:49,608 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 10:42:49,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:49,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:49,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:49,701 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-02 10:42:49,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-12-02 10:42:49,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 452 states and 575 transitions. Complement of second has 15 states. [2018-12-02 10:42:49,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 10:42:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 10:42:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-12-02 10:42:49,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 64 letters. Loop has 8 letters. [2018-12-02 10:42:49,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:49,757 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 10:42:49,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:49,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:49,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:49,837 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-02 10:42:49,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-12-02 10:42:49,887 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 452 states and 575 transitions. Complement of second has 15 states. [2018-12-02 10:42:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 10:42:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 10:42:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-12-02 10:42:49,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 64 letters. Loop has 8 letters. [2018-12-02 10:42:49,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:49,888 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 10:42:49,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:42:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:49,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:42:49,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:42:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:42:50,000 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-02 10:42:50,000 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-12-02 10:42:50,090 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 739 states and 924 transitions. Complement of second has 27 states. [2018-12-02 10:42:50,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-02 10:42:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 10:42:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-12-02 10:42:50,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 8 letters. [2018-12-02 10:42:50,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:50,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 72 letters. Loop has 8 letters. [2018-12-02 10:42:50,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:50,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 16 letters. [2018-12-02 10:42:50,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:42:50,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 739 states and 924 transitions. [2018-12-02 10:42:50,097 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 10:42:50,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 739 states to 0 states and 0 transitions. [2018-12-02 10:42:50,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 10:42:50,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 10:42:50,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 10:42:50,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 10:42:50,097 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:42:50,097 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:42:50,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:42:50,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:42:50,097 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 21 states. [2018-12-02 10:42:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:42:50,097 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-02 10:42:50,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 10:42:50,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-02 10:42:50,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 10:42:50,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 10:42:50,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 10:42:50,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 10:42:50,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 10:42:50,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 10:42:50,098 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:42:50,098 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:42:50,098 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:42:50,098 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 10:42:50,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 10:42:50,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 10:42:50,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 10:42:50,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 10:42:50 BoogieIcfgContainer [2018-12-02 10:42:50,103 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 10:42:50,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 10:42:50,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 10:42:50,103 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 10:42:50,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:42:42" (3/4) ... [2018-12-02 10:42:50,106 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 10:42:50,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 10:42:50,107 INFO L168 Benchmark]: Toolchain (without parser) took 8139.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.5 MB). Free memory was 954.4 MB in the beginning and 1.3 GB in the end (delta: -377.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:42:50,108 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:42:50,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.27 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 10:42:50,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.47 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:42:50,108 INFO L168 Benchmark]: Boogie Preprocessor took 10.61 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 10:42:50,109 INFO L168 Benchmark]: RCFGBuilder took 157.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 10:42:50,109 INFO L168 Benchmark]: BuchiAutomizer took 7821.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-12-02 10:42:50,110 INFO L168 Benchmark]: Witness Printer took 3.27 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:42:50,112 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 125.27 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.47 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.61 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7821.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.27 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 9 iterations. TraceHistogramMax:12. Analysis of lassos took 4.6s. Construction of modules took 0.8s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 289 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 427 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 305 SDtfs, 775 SDslu, 899 SDs, 0 SdLazy, 2034 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI4 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 25 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...