./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 dd317ac0ecdb37853dacea373914a521115465e0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:24,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:24,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:24,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:24,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:24,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:24,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:24,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:24,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:24,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:24,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:24,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:24,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:24,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:24,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:24,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:24,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:24,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:24,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:24,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:24,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:24,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:24,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:24,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:24,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:24,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:24,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:24,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:24,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:24,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:24,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:24,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:24,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:24,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:24,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:24,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:24,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:24,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:24,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:24,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:24,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:24,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:24,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:24,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:24,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:24,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:24,958 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:24,958 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:24,959 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:24,959 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:24,959 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:24,959 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:24,959 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:24,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:24,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:24,960 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:24,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:24,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:24,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:24,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:24,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:24,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:24,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:24,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:24,970 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:24,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:24,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:24,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:24,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:24,971 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:24,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:24,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:24,971 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:24,972 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:24,972 INFO L138 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_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 -> dd317ac0ecdb37853dacea373914a521115465e0 [2019-10-22 09:02:25,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:25,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:25,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:25,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:25,017 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:25,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10-2.c [2019-10-22 09:02:25,062 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/data/863783c0f/d0234c3273664c8d82bdc156cc577b3d/FLAG00a33bd00 [2019-10-22 09:02:25,438 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:25,439 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/sv-benchmarks/c/recursive-simple/fibo_10-2.c [2019-10-22 09:02:25,445 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/data/863783c0f/d0234c3273664c8d82bdc156cc577b3d/FLAG00a33bd00 [2019-10-22 09:02:25,850 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/data/863783c0f/d0234c3273664c8d82bdc156cc577b3d [2019-10-22 09:02:25,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:25,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:25,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:25,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:25,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:25,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:25" (1/1) ... [2019-10-22 09:02:25,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485edf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:25, skipping insertion in model container [2019-10-22 09:02:25,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:25" (1/1) ... [2019-10-22 09:02:25,869 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:25,883 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:26,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:26,055 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:26,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:26,135 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:26,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26 WrapperNode [2019-10-22 09:02:26,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:26,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:26,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:26,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:26,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:26,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:26,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:26,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:26,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:26,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:26,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:26,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:26,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:26,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-10-22 09:02:26,266 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-10-22 09:02:26,407 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:26,408 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 09:02:26,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:26 BoogieIcfgContainer [2019-10-22 09:02:26,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:26,410 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:26,410 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:26,413 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:26,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:26,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:25" (1/3) ... [2019-10-22 09:02:26,415 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4860790a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:26, skipping insertion in model container [2019-10-22 09:02:26,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:26,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (2/3) ... [2019-10-22 09:02:26,416 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4860790a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:26, skipping insertion in model container [2019-10-22 09:02:26,416 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:26,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:26" (3/3) ... [2019-10-22 09:02:26,418 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_10-2.c [2019-10-22 09:02:26,471 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:26,472 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:26,472 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:26,472 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:26,474 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:26,474 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:26,474 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:26,474 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:26,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 09:02:26,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:02:26,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:26,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:26,521 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:02:26,522 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:26,522 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:26,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 09:02:26,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:02:26,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:26,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:26,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:02:26,524 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:26,531 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-10-22 09:02:26,532 INFO L793 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2019-10-22 09:02:26,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:26,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-10-22 09:02:26,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:26,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447215630] [2019-10-22 09:02:26,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:26,627 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-10-22 09:02:26,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:26,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912494767] [2019-10-22 09:02:26,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:26,639 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:26,641 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-10-22 09:02:26,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:26,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67355949] [2019-10-22 09:02:26,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:26,653 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:26,744 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:26,745 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:26,745 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:26,745 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:26,745 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:26,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:26,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:26,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:26,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration1_Loop [2019-10-22 09:02:26,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:26,746 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:26,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,880 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:26,881 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:26,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:26,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:26,908 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:26,908 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:26,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:26,916 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:26,921 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:26,921 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:26,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:26,929 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:26,934 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:26,934 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:26,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:26,946 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:26,950 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:26,951 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:26,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:26,956 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:26,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:26,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:26,982 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:26,983 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:26,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:26,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:26,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:26,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:26,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:26,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:26,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:26,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration1_Loop [2019-10-22 09:02:26,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:26,984 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:26,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,058 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:27,063 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:27,067 INFO L120 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 [2019-10-22 09:02:27,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,077 INFO L120 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 [2019-10-22 09:02:27,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,082 INFO L120 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 [2019-10-22 09:02:27,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,087 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,088 INFO L120 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 [2019-10-22 09:02:27,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,095 INFO L120 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 [2019-10-22 09:02:27,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,099 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,099 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,108 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:27,115 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:27,117 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:27,119 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:27,119 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:27,120 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:27,121 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-10-22 09:02:27,124 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:27,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:27,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:27,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:27,218 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:02:27,219 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-10-22 09:02:27,318 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2019-10-22 09:02:27,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:02:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-10-22 09:02:27,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 09:02:27,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:27,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 09:02:27,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:27,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-10-22 09:02:27,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:27,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-10-22 09:02:27,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:02:27,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-10-22 09:02:27,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 09:02:27,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 09:02:27,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-10-22 09:02:27,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:27,340 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 09:02:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-10-22 09:02:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-10-22 09:02:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:02:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-10-22 09:02:27,368 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 09:02:27,368 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 09:02:27,368 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:27,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-10-22 09:02:27,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:02:27,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:27,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:27,370 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:27,370 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:27,371 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-10-22 09:02:27,371 INFO L793 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2019-10-22 09:02:27,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,371 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-10-22 09:02:27,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:27,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982087653] [2019-10-22 09:02:27,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:27,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982087653] [2019-10-22 09:02:27,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750405927] [2019-10-22 09:02:27,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:27,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:27,514 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:27,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-22 09:02:27,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962005965] [2019-10-22 09:02:27,518 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-10-22 09:02:27,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:27,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321932235] [2019-10-22 09:02:27,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:02:27,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321932235] [2019-10-22 09:02:27,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:27,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:27,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875948217] [2019-10-22 09:02:27,589 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:27,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:27,593 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-10-22 09:02:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:27,675 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-10-22 09:02:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:27,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-10-22 09:02:27,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:02:27,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-10-22 09:02:27,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 09:02:27,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 09:02:27,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-10-22 09:02:27,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:27,680 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 09:02:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-10-22 09:02:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-22 09:02:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 09:02:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-10-22 09:02:27,690 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 09:02:27,690 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 09:02:27,690 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:27,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-10-22 09:02:27,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:02:27,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:27,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:27,692 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:27,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:27,693 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 221#L25 call main_#t~ret2 := fibo(main_~x~0);< 225#fiboENTRY ~n := #in~n; 226#L6 assume !(~n < 1); 224#L8 assume !(1 == ~n); 218#L11 call #t~ret0 := fibo(~n - 1);< 227#fiboENTRY ~n := #in~n; 228#L6 assume !(~n < 1); 222#L8 assume 1 == ~n;#res := 1; 223#fiboFINAL assume true; 217#fiboEXIT >#32#return; 219#L11-1 [2019-10-22 09:02:27,693 INFO L793 eck$LassoCheckResult]: Loop: 219#L11-1 call #t~ret1 := fibo(~n - 2);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume !(1 == ~n); 230#L11 call #t~ret0 := fibo(~n - 1);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume 1 == ~n;#res := 1; 236#fiboFINAL assume true; 234#fiboEXIT >#32#return; 219#L11-1 [2019-10-22 09:02:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-10-22 09:02:27,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:27,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809090136] [2019-10-22 09:02:27,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:27,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809090136] [2019-10-22 09:02:27,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182597120] [2019-10-22 09:02:27,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:27,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:27,808 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:27,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-22 09:02:27,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201372764] [2019-10-22 09:02:27,809 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-10-22 09:02:27,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:27,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757007484] [2019-10-22 09:02:27,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:27,829 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:27,937 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:27,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:27,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:27,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:27,938 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:27,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:27,938 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:27,938 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:27,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration3_Loop [2019-10-22 09:02:27,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:27,939 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:27,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,011 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:28,011 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:28,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:28,018 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:28,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:28,031 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:28,432 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:28,435 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:28,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:28,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:28,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:28,440 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:28,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:28,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:28,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:28,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration3_Loop [2019-10-22 09:02:28,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:28,441 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:28,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,501 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:28,501 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:28,501 INFO L120 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 [2019-10-22 09:02:28,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:28,502 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:28,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:28,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:28,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:28,504 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:28,504 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:28,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:28,509 INFO L120 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 [2019-10-22 09:02:28,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:28,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:28,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:28,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:28,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:28,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:28,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:28,518 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:28,526 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:28,527 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:28,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:28,527 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:28,528 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:28,528 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-10-22 09:02:28,528 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:28,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:28,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:28,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:02:28,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:28,687 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 [2019-10-22 09:02:28,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-10-22 09:02:28,876 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2019-10-22 09:02:28,876 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 [2019-10-22 09:02:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 09:02:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-10-22 09:02:28,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-10-22 09:02:28,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:28,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-10-22 09:02:28,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:28,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-10-22 09:02:28,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:28,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-10-22 09:02:28,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 09:02:28,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-10-22 09:02:28,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-10-22 09:02:28,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-10-22 09:02:28,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-10-22 09:02:28,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:28,893 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-10-22 09:02:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-10-22 09:02:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-10-22 09:02:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 09:02:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-10-22 09:02:28,907 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-10-22 09:02:28,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:28,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:02:28,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:02:28,908 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 8 states. [2019-10-22 09:02:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:28,994 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-10-22 09:02:28,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:28,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-10-22 09:02:28,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 09:02:29,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-10-22 09:02:29,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-10-22 09:02:29,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-10-22 09:02:29,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-10-22 09:02:29,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:29,003 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-10-22 09:02:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-10-22 09:02:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-10-22 09:02:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 09:02:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-10-22 09:02:29,014 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-10-22 09:02:29,015 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-10-22 09:02:29,015 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:29,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-10-22 09:02:29,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 09:02:29,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:29,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:29,018 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:29,018 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1] [2019-10-22 09:02:29,019 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 745#L25 call main_#t~ret2 := fibo(main_~x~0);< 769#fiboENTRY ~n := #in~n; 793#L6 assume !(~n < 1); 752#L8 assume !(1 == ~n); 753#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 761#L6 assume !(~n < 1); 772#L8 assume !(1 == ~n); 760#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 761#L6 assume !(~n < 1); 772#L8 assume !(1 == ~n); 760#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 762#L6 assume !(~n < 1); 796#L8 assume 1 == ~n;#res := 1; 795#fiboFINAL assume true; 794#fiboEXIT >#32#return; 757#L11-1 call #t~ret1 := fibo(~n - 2);< 756#fiboENTRY ~n := #in~n; 758#L6 assume ~n < 1;#res := 0; 823#fiboFINAL assume true; 817#fiboEXIT >#34#return; 814#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 812#fiboFINAL assume true; 802#fiboEXIT >#32#return; 804#L11-1 [2019-10-22 09:02:29,019 INFO L793 eck$LassoCheckResult]: Loop: 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume 1 == ~n;#res := 1; 816#fiboFINAL assume true; 813#fiboEXIT >#32#return; 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume 1 == ~n;#res := 1; 816#fiboFINAL assume true; 813#fiboEXIT >#32#return; 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume ~n < 1;#res := 0; 819#fiboFINAL assume true; 821#fiboEXIT >#34#return; 809#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 811#fiboFINAL assume true; 807#fiboEXIT >#34#return; 809#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 811#fiboFINAL assume true; 807#fiboEXIT >#32#return; 804#L11-1 [2019-10-22 09:02:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-10-22 09:02:29,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052467592] [2019-10-22 09:02:29,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:29,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052467592] [2019-10-22 09:02:29,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188983172] [2019-10-22 09:02:29,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:02:29,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:29,209 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:29,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-10-22 09:02:29,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183089112] [2019-10-22 09:02:29,210 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1408722332, now seen corresponding path program 1 times [2019-10-22 09:02:29,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043971255] [2019-10-22 09:02:29,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-22 09:02:29,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043971255] [2019-10-22 09:02:29,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969423956] [2019-10-22 09:02:29,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:29,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-22 09:02:29,421 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:29,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-10-22 09:02:29,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553233432] [2019-10-22 09:02:29,421 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:29,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:29,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 09:02:29,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:02:29,422 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 12 states. [2019-10-22 09:02:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:29,581 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2019-10-22 09:02:29,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:02:29,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 157 transitions. [2019-10-22 09:02:29,584 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-10-22 09:02:29,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 113 states and 155 transitions. [2019-10-22 09:02:29,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-10-22 09:02:29,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-10-22 09:02:29,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 155 transitions. [2019-10-22 09:02:29,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:29,588 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-10-22 09:02:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 155 transitions. [2019-10-22 09:02:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-22 09:02:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-22 09:02:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2019-10-22 09:02:29,597 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-10-22 09:02:29,597 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-10-22 09:02:29,597 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:29,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 155 transitions. [2019-10-22 09:02:29,599 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-10-22 09:02:29,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:29,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:29,600 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:29,600 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-10-22 09:02:29,601 INFO L791 eck$LassoCheckResult]: Stem: 1248#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 1249#L25 call main_#t~ret2 := fibo(main_~x~0);< 1278#fiboENTRY ~n := #in~n; 1308#L6 assume !(~n < 1); 1307#L8 assume !(1 == ~n); 1256#L11 call #t~ret0 := fibo(~n - 1);< 1273#fiboENTRY ~n := #in~n; 1274#L6 assume !(~n < 1); 1255#L8 assume !(1 == ~n); 1257#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1305#L6 assume !(~n < 1); 1303#L8 assume !(1 == ~n); 1263#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1305#L6 assume !(~n < 1); 1303#L8 assume !(1 == ~n); 1263#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1306#L6 assume !(~n < 1); 1304#L8 assume 1 == ~n;#res := 1; 1302#fiboFINAL assume true; 1300#fiboEXIT >#32#return; 1243#L11-1 call #t~ret1 := fibo(~n - 2);< 1298#fiboENTRY ~n := #in~n; 1345#L6 assume ~n < 1;#res := 0; 1344#fiboFINAL assume true; 1342#fiboEXIT >#34#return; 1340#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1339#fiboFINAL assume true; 1332#fiboEXIT >#32#return; 1260#L11-1 [2019-10-22 09:02:29,601 INFO L793 eck$LassoCheckResult]: Loop: 1260#L11-1 call #t~ret1 := fibo(~n - 2);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume !(1 == ~n); 1262#L11 call #t~ret0 := fibo(~n - 1);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume !(1 == ~n); 1262#L11 call #t~ret0 := fibo(~n - 1);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume 1 == ~n;#res := 1; 1254#fiboFINAL assume true; 1346#fiboEXIT >#32#return; 1252#L11-1 call #t~ret1 := fibo(~n - 2);< 1271#fiboENTRY ~n := #in~n; 1272#L6 assume ~n < 1;#res := 0; 1310#fiboFINAL assume true; 1347#fiboEXIT >#34#return; 1244#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1258#fiboFINAL assume true; 1264#fiboEXIT >#32#return; 1260#L11-1 [2019-10-22 09:02:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292419, now seen corresponding path program 2 times [2019-10-22 09:02:29,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513961280] [2019-10-22 09:02:29,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:29,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513961280] [2019-10-22 09:02:29,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145728819] [2019-10-22 09:02:29,715 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:29,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:02:29,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:29,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 09:02:29,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:29,782 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:29,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-10-22 09:02:29,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857219090] [2019-10-22 09:02:29,783 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,783 INFO L82 PathProgramCache]: Analyzing trace with hash 22774646, now seen corresponding path program 2 times [2019-10-22 09:02:29,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740043198] [2019-10-22 09:02:29,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:29,805 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:30,022 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:30,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:30,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:30,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:30,023 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:30,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:30,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:30,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:30,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration5_Loop [2019-10-22 09:02:30,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:30,023 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:30,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,081 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:30,081 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:30,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:30,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:30,088 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:30,088 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:30,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:30,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:30,096 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:30,096 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:30,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:30,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:30,105 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:30,105 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=1} Honda state: {fibo_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:30,110 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:30,110 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:30,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:30,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:30,608 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:30,610 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:30,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:30,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:30,610 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:30,610 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:30,611 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:30,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:30,611 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:30,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration5_Loop [2019-10-22 09:02:30,611 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:30,611 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:30,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,699 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:30,699 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:30,699 INFO L120 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 [2019-10-22 09:02:30,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,700 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:30,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,700 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:30,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:30,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,703 INFO L120 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 [2019-10-22 09:02:30,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,703 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:30,703 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,703 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,704 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:30,704 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:30,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,706 INFO L120 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 [2019-10-22 09:02:30,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,706 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:30,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,708 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:30,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:30,712 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:30,715 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:30,715 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:30,716 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:30,716 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:30,716 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:30,716 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-10-22 09:02:30,717 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:02:30,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:30,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:30,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 09:02:30,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 09:02:30,917 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-10-22 09:02:30,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-10-22 09:02:31,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48. Second operand 8 states. Result 182 states and 247 transitions. Complement of second has 33 states. [2019-10-22 09:02:31,138 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 [2019-10-22 09:02:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:02:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-10-22 09:02:31,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 31 letters. Loop has 22 letters. [2019-10-22 09:02:31,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,139 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 09:02:31,275 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-10-22 09:02:31,276 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-10-22 09:02:31,432 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48. Second operand 8 states. Result 307 states and 416 transitions. Complement of second has 25 states. [2019-10-22 09:02:31,435 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 [2019-10-22 09:02:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:02:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-10-22 09:02:31,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 31 letters. Loop has 22 letters. [2019-10-22 09:02:31,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,436 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 09:02:31,596 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 6 loop predicates [2019-10-22 09:02:31,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-10-22 09:02:31,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48. Second operand 8 states. Result 1077 states and 1512 transitions. Complement of second has 130 states. [2019-10-22 09:02:31,824 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 [2019-10-22 09:02:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:02:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-10-22 09:02:31,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 22 letters. [2019-10-22 09:02:31,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 53 letters. Loop has 22 letters. [2019-10-22 09:02:31,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 44 letters. [2019-10-22 09:02:31,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1077 states and 1512 transitions. [2019-10-22 09:02:31,848 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2019-10-22 09:02:31,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1077 states to 604 states and 935 transitions. [2019-10-22 09:02:31,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-10-22 09:02:31,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2019-10-22 09:02:31,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 935 transitions. [2019-10-22 09:02:31,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:31,866 INFO L688 BuchiCegarLoop]: Abstraction has 604 states and 935 transitions. [2019-10-22 09:02:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 935 transitions. [2019-10-22 09:02:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 477. [2019-10-22 09:02:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-22 09:02:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 725 transitions. [2019-10-22 09:02:31,908 INFO L711 BuchiCegarLoop]: Abstraction has 477 states and 725 transitions. [2019-10-22 09:02:31,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:31,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:02:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:02:31,909 INFO L87 Difference]: Start difference. First operand 477 states and 725 transitions. Second operand 14 states. [2019-10-22 09:02:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:32,164 INFO L93 Difference]: Finished difference Result 537 states and 809 transitions. [2019-10-22 09:02:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:02:32,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 809 transitions. [2019-10-22 09:02:32,172 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-10-22 09:02:32,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 534 states and 802 transitions. [2019-10-22 09:02:32,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2019-10-22 09:02:32,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2019-10-22 09:02:32,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 534 states and 802 transitions. [2019-10-22 09:02:32,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:32,186 INFO L688 BuchiCegarLoop]: Abstraction has 534 states and 802 transitions. [2019-10-22 09:02:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states and 802 transitions. [2019-10-22 09:02:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 494. [2019-10-22 09:02:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-22 09:02:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 746 transitions. [2019-10-22 09:02:32,221 INFO L711 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-10-22 09:02:32,222 INFO L591 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-10-22 09:02:32,222 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:32,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 494 states and 746 transitions. [2019-10-22 09:02:32,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-10-22 09:02:32,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:32,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:32,226 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:32,227 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:32,227 INFO L791 eck$LassoCheckResult]: Stem: 4807#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 4808#L25 call main_#t~ret2 := fibo(main_~x~0);< 4845#fiboENTRY ~n := #in~n; 4869#L6 assume !(~n < 1); 4868#L8 assume !(1 == ~n); 4864#L11 call #t~ret0 := fibo(~n - 1);< 4867#fiboENTRY ~n := #in~n; 4866#L6 assume !(~n < 1); 4865#L8 assume !(1 == ~n); 4860#L11 call #t~ret0 := fibo(~n - 1);< 4862#fiboENTRY ~n := #in~n; 4863#L6 assume !(~n < 1); 4859#L8 assume !(1 == ~n); 4811#L11 call #t~ret0 := fibo(~n - 1);< 4856#fiboENTRY ~n := #in~n; 4857#L6 assume !(~n < 1); 4861#L8 assume !(1 == ~n); 4810#L11 call #t~ret0 := fibo(~n - 1);< 4856#fiboENTRY ~n := #in~n; 4858#L6 assume !(~n < 1); 4809#L8 assume 1 == ~n;#res := 1; 4812#fiboFINAL assume true; 4953#fiboEXIT >#32#return; 4933#L11-1 call #t~ret1 := fibo(~n - 2);< 4941#fiboENTRY ~n := #in~n; 5030#L6 assume !(~n < 1); 4957#L8 assume !(1 == ~n); 4958#L11 call #t~ret0 := fibo(~n - 1);< 4967#fiboENTRY ~n := #in~n; 5112#L6 assume !(~n < 1); 5035#L8 assume !(1 == ~n); 5036#L11 call #t~ret0 := fibo(~n - 1);< 5054#fiboENTRY [2019-10-22 09:02:32,227 INFO L793 eck$LassoCheckResult]: Loop: 5054#fiboENTRY ~n := #in~n; 5065#L6 assume !(~n < 1); 5062#L8 assume !(1 == ~n); 5051#L11 call #t~ret0 := fibo(~n - 1);< 5054#fiboENTRY [2019-10-22 09:02:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash 116207529, now seen corresponding path program 1 times [2019-10-22 09:02:32,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:32,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347224872] [2019-10-22 09:02:32,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:32,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347224872] [2019-10-22 09:02:32,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235659921] [2019-10-22 09:02:32,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 09:02:32,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:02:32,477 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:32,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 20 [2019-10-22 09:02:32,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136219651] [2019-10-22 09:02:32,478 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:32,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-10-22 09:02:32,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:32,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568395961] [2019-10-22 09:02:32,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:32,487 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:32,520 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:32,520 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:32,520 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:32,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:32,520 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:32,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:32,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:32,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:32,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration6_Loop [2019-10-22 09:02:32,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:32,521 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:32,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,560 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:32,560 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:32,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:32,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:32,567 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:32,567 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:32,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:32,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:32,573 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:32,573 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:32,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:32,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:32,580 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:32,580 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:32,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:32,585 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:32,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:32,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:32,624 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:32,626 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:32,627 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:32,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:32,627 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:32,627 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:32,627 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:32,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:32,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:32,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration6_Loop [2019-10-22 09:02:32,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:32,627 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:32,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,683 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:32,683 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:32,683 INFO L120 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 [2019-10-22 09:02:32,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:32,684 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:32,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:32,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:32,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:32,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:32,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:32,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:32,685 INFO L120 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 [2019-10-22 09:02:32,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:32,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:32,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:32,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:32,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:32,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:32,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:32,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:32,687 INFO L120 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 [2019-10-22 09:02:32,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:32,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:32,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:32,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:32,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:32,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:32,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:32,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:32,690 INFO L120 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 [2019-10-22 09:02:32,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:32,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:32,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:32,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:32,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:32,691 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:32,691 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:32,692 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:32,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:32,694 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:32,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:32,695 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:32,695 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:32,695 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-10-22 09:02:32,695 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 09:02:32,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:32,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:32,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 09:02:32,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-10-22 09:02:32,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262. Second operand 5 states. Result 507 states and 759 transitions. Complement of second has 13 states. [2019-10-22 09:02:32,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-10-22 09:02:32,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 32 letters. Loop has 4 letters. [2019-10-22 09:02:32,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:32,853 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 09:02:32,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:32,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:32,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 09:02:32,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-10-22 09:02:32,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262. Second operand 5 states. Result 507 states and 759 transitions. Complement of second has 13 states. [2019-10-22 09:02:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-10-22 09:02:32,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 32 letters. Loop has 4 letters. [2019-10-22 09:02:32,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:32,989 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 09:02:33,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:33,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:33,071 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 3 loop predicates [2019-10-22 09:02:33,071 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-10-22 09:02:33,146 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262. Second operand 5 states. Result 650 states and 920 transitions. Complement of second has 14 states. [2019-10-22 09:02:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-10-22 09:02:33,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-10-22 09:02:33,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:33,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 4 letters. [2019-10-22 09:02:33,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:33,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 8 letters. [2019-10-22 09:02:33,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:33,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 920 transitions. [2019-10-22 09:02:33,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-10-22 09:02:33,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 548 states and 806 transitions. [2019-10-22 09:02:33,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2019-10-22 09:02:33,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2019-10-22 09:02:33,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 806 transitions. [2019-10-22 09:02:33,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:33,180 INFO L688 BuchiCegarLoop]: Abstraction has 548 states and 806 transitions. [2019-10-22 09:02:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 806 transitions. [2019-10-22 09:02:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 518. [2019-10-22 09:02:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-10-22 09:02:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 770 transitions. [2019-10-22 09:02:33,203 INFO L711 BuchiCegarLoop]: Abstraction has 518 states and 770 transitions. [2019-10-22 09:02:33,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 09:02:33,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:02:33,204 INFO L87 Difference]: Start difference. First operand 518 states and 770 transitions. Second operand 20 states. [2019-10-22 09:02:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:33,491 INFO L93 Difference]: Finished difference Result 585 states and 871 transitions. [2019-10-22 09:02:33,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:02:33,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 585 states and 871 transitions. [2019-10-22 09:02:33,498 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-10-22 09:02:33,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 585 states to 575 states and 857 transitions. [2019-10-22 09:02:33,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2019-10-22 09:02:33,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2019-10-22 09:02:33,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 575 states and 857 transitions. [2019-10-22 09:02:33,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:33,506 INFO L688 BuchiCegarLoop]: Abstraction has 575 states and 857 transitions. [2019-10-22 09:02:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states and 857 transitions. [2019-10-22 09:02:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 541. [2019-10-22 09:02:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-22 09:02:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 807 transitions. [2019-10-22 09:02:33,522 INFO L711 BuchiCegarLoop]: Abstraction has 541 states and 807 transitions. [2019-10-22 09:02:33,522 INFO L591 BuchiCegarLoop]: Abstraction has 541 states and 807 transitions. [2019-10-22 09:02:33,522 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:33,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 541 states and 807 transitions. [2019-10-22 09:02:33,525 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-10-22 09:02:33,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:33,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:33,526 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 8, 7, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:33,527 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:33,527 INFO L791 eck$LassoCheckResult]: Stem: 8597#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8598#L25 call main_#t~ret2 := fibo(main_~x~0);< 8631#fiboENTRY ~n := #in~n; 8671#L6 assume !(~n < 1); 8669#L8 assume !(1 == ~n); 8666#L11 call #t~ret0 := fibo(~n - 1);< 8667#fiboENTRY ~n := #in~n; 8677#L6 assume !(~n < 1); 8676#L8 assume !(1 == ~n); 8653#L11 call #t~ret0 := fibo(~n - 1);< 8675#fiboENTRY ~n := #in~n; 8679#L6 assume !(~n < 1); 8660#L8 assume !(1 == ~n); 8655#L11 call #t~ret0 := fibo(~n - 1);< 8657#fiboENTRY ~n := #in~n; 8711#L6 assume !(~n < 1); 8708#L8 assume !(1 == ~n); 8649#L11 call #t~ret0 := fibo(~n - 1);< 8656#fiboENTRY ~n := #in~n; 8721#L6 assume !(~n < 1); 8710#L8 assume !(1 == ~n); 8648#L11 call #t~ret0 := fibo(~n - 1);< 8656#fiboENTRY ~n := #in~n; 8730#L6 assume !(~n < 1); 8796#L8 assume 1 == ~n;#res := 1; 8794#fiboFINAL assume true; 8793#fiboEXIT >#32#return; 8785#L11-1 call #t~ret1 := fibo(~n - 2);< 8792#fiboENTRY ~n := #in~n; 9030#L6 assume !(~n < 1); 9006#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8639#fiboENTRY ~n := #in~n; 8640#L6 assume !(~n < 1); 9118#L8 assume !(1 == ~n); 8633#L11 call #t~ret0 := fibo(~n - 1);< 8637#fiboENTRY ~n := #in~n; 8638#L6 assume !(~n < 1); 9103#L8 assume !(1 == ~n); 8634#L11 [2019-10-22 09:02:33,527 INFO L793 eck$LassoCheckResult]: Loop: 8634#L11 call #t~ret0 := fibo(~n - 1);< 8637#fiboENTRY ~n := #in~n; 8638#L6 assume !(~n < 1); 9103#L8 assume !(1 == ~n); 8634#L11 [2019-10-22 09:02:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,527 INFO L82 PathProgramCache]: Analyzing trace with hash -989900256, now seen corresponding path program 2 times [2019-10-22 09:02:33,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022928612] [2019-10-22 09:02:33,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 9 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:33,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022928612] [2019-10-22 09:02:33,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878040937] [2019-10-22 09:02:33,728 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:33,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:02:33,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:33,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:02:33,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 64 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-22 09:02:33,797 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:33,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 24 [2019-10-22 09:02:33,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613700132] [2019-10-22 09:02:33,798 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2019-10-22 09:02:33,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365162882] [2019-10-22 09:02:33,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:33,803 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:33,840 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:33,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:33,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:33,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:33,840 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:33,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:33,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:33,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:33,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration7_Loop [2019-10-22 09:02:33,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:33,841 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:33,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:33,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:33,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:33,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:33,889 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:33,889 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:33,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:33,897 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:33,901 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:33,901 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:33,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:33,908 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:33,911 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:33,911 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:33,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:33,919 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:33,922 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:33,922 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:33,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:33,928 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:33,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:33,940 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:39,233 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:39,235 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:39,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:39,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:39,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:39,235 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:39,235 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:39,235 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:39,235 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:39,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration7_Loop [2019-10-22 09:02:39,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:39,236 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:39,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,299 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:39,299 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:39,299 INFO L120 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 [2019-10-22 09:02:39,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,300 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,302 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,302 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,303 INFO L120 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 [2019-10-22 09:02:39,304 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,304 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,305 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,305 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,306 INFO L120 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 [2019-10-22 09:02:39,307 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,307 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,308 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,308 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,308 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,308 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,311 INFO L120 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 [2019-10-22 09:02:39,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,312 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,313 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,313 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,315 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:39,318 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:39,326 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:39,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:39,326 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:39,327 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:39,327 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-10-22 09:02:39,327 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:39,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:02:39,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:39,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:39,420 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 09:02:39,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276 Second operand 6 states. [2019-10-22 09:02:39,467 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276. Second operand 6 states. Result 556 states and 823 transitions. Complement of second has 18 states. [2019-10-22 09:02:39,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-10-22 09:02:39,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 39 letters. Loop has 4 letters. [2019-10-22 09:02:39,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:39,495 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:02:39,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:39,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:39,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 09:02:39,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276 Second operand 6 states. [2019-10-22 09:02:39,673 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276. Second operand 6 states. Result 786 states and 1145 transitions. Complement of second has 22 states. [2019-10-22 09:02:39,674 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 [2019-10-22 09:02:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-10-22 09:02:39,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 39 letters. Loop has 4 letters. [2019-10-22 09:02:39,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:39,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 4 letters. [2019-10-22 09:02:39,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:39,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 39 letters. Loop has 8 letters. [2019-10-22 09:02:39,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:39,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 786 states and 1145 transitions. [2019-10-22 09:02:39,683 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-10-22 09:02:39,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 786 states to 719 states and 1073 transitions. [2019-10-22 09:02:39,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2019-10-22 09:02:39,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2019-10-22 09:02:39,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 719 states and 1073 transitions. [2019-10-22 09:02:39,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:39,692 INFO L688 BuchiCegarLoop]: Abstraction has 719 states and 1073 transitions. [2019-10-22 09:02:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states and 1073 transitions. [2019-10-22 09:02:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 706. [2019-10-22 09:02:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-10-22 09:02:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1056 transitions. [2019-10-22 09:02:39,711 INFO L711 BuchiCegarLoop]: Abstraction has 706 states and 1056 transitions. [2019-10-22 09:02:39,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-22 09:02:39,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-10-22 09:02:39,712 INFO L87 Difference]: Start difference. First operand 706 states and 1056 transitions. Second operand 24 states. [2019-10-22 09:02:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:40,039 INFO L93 Difference]: Finished difference Result 794 states and 1182 transitions. [2019-10-22 09:02:40,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 09:02:40,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 794 states and 1182 transitions. [2019-10-22 09:02:40,050 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-10-22 09:02:40,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 794 states to 779 states and 1160 transitions. [2019-10-22 09:02:40,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2019-10-22 09:02:40,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2019-10-22 09:02:40,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 779 states and 1160 transitions. [2019-10-22 09:02:40,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:40,063 INFO L688 BuchiCegarLoop]: Abstraction has 779 states and 1160 transitions. [2019-10-22 09:02:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states and 1160 transitions. [2019-10-22 09:02:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 761. [2019-10-22 09:02:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-22 09:02:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1128 transitions. [2019-10-22 09:02:40,088 INFO L711 BuchiCegarLoop]: Abstraction has 761 states and 1128 transitions. [2019-10-22 09:02:40,088 INFO L591 BuchiCegarLoop]: Abstraction has 761 states and 1128 transitions. [2019-10-22 09:02:40,088 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:02:40,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 761 states and 1128 transitions. [2019-10-22 09:02:40,092 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-10-22 09:02:40,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:40,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:40,093 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 9, 8, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:40,095 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:40,096 INFO L791 eck$LassoCheckResult]: Stem: 12464#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 12465#L25 call main_#t~ret2 := fibo(main_~x~0);< 12492#fiboENTRY ~n := #in~n; 12553#L6 assume !(~n < 1); 12554#L8 assume !(1 == ~n); 12548#L11 call #t~ret0 := fibo(~n - 1);< 12549#fiboENTRY ~n := #in~n; 12574#L6 assume !(~n < 1); 12551#L8 assume !(1 == ~n); 12547#L11 call #t~ret0 := fibo(~n - 1);< 12573#fiboENTRY ~n := #in~n; 12571#L6 assume !(~n < 1); 12569#L8 assume !(1 == ~n); 12556#L11 call #t~ret0 := fibo(~n - 1);< 12566#fiboENTRY ~n := #in~n; 12572#L6 assume !(~n < 1); 12570#L8 assume !(1 == ~n); 12561#L11 call #t~ret0 := fibo(~n - 1);< 12568#fiboENTRY ~n := #in~n; 12600#L6 assume !(~n < 1); 12599#L8 assume !(1 == ~n); 12584#L11 call #t~ret0 := fibo(~n - 1);< 12591#fiboENTRY ~n := #in~n; 12630#L6 assume !(~n < 1); 12621#L8 assume !(1 == ~n); 12586#L11 call #t~ret0 := fibo(~n - 1);< 12595#fiboENTRY ~n := #in~n; 12702#L6 assume !(~n < 1); 12693#L8 assume 1 == ~n;#res := 1; 12692#fiboFINAL assume true; 12685#fiboEXIT >#32#return; 12626#L11-1 call #t~ret1 := fibo(~n - 2);< 12628#fiboENTRY ~n := #in~n; 12664#L6 assume ~n < 1;#res := 0; 12659#fiboFINAL assume true; 12625#fiboEXIT >#34#return; 12620#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 12594#fiboFINAL assume true; 12590#fiboEXIT >#32#return; 12585#L11-1 call #t~ret1 := fibo(~n - 2);< 12588#fiboENTRY ~n := #in~n; 12798#L6 assume !(~n < 1); 12796#L8 assume !(1 == ~n); 12792#L11 call #t~ret0 := fibo(~n - 1);< 12793#fiboENTRY ~n := #in~n; 12861#L6 assume !(~n < 1); 12860#L8 assume !(1 == ~n); 12854#L11 call #t~ret0 := fibo(~n - 1);< 12858#fiboENTRY ~n := #in~n; 12892#L6 assume !(~n < 1); 12890#L8 assume !(1 == ~n); 12852#L11 [2019-10-22 09:02:40,096 INFO L793 eck$LassoCheckResult]: Loop: 12852#L11 call #t~ret0 := fibo(~n - 1);< 12858#fiboENTRY ~n := #in~n; 12892#L6 assume !(~n < 1); 12890#L8 assume !(1 == ~n); 12852#L11 [2019-10-22 09:02:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1997475882, now seen corresponding path program 3 times [2019-10-22 09:02:40,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710448620] [2019-10-22 09:02:40,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 20 proven. 165 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:40,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710448620] [2019-10-22 09:02:40,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305325045] [2019-10-22 09:02:40,351 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:40,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-22 09:02:40,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:40,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 09:02:40,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 19 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-22 09:02:40,478 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:40,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 30 [2019-10-22 09:02:40,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410740342] [2019-10-22 09:02:40,479 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2019-10-22 09:02:40,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433647553] [2019-10-22 09:02:40,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,485 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,522 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:40,522 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:40,522 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:40,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:40,522 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:40,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:40,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:40,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:40,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration8_Loop [2019-10-22 09:02:40,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:40,523 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:40,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,561 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:40,561 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:40,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:40,564 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:40,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:40,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:42,894 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:42,896 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:42,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:42,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:42,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:42,896 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:42,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:42,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:42,896 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:42,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration8_Loop [2019-10-22 09:02:42,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:42,896 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:42,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,937 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:42,938 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:42,938 INFO L120 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 [2019-10-22 09:02:42,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,938 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,939 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,939 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,939 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,939 INFO L120 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 [2019-10-22 09:02:42,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,940 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,940 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,941 INFO L120 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 [2019-10-22 09:02:42,942 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,942 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,942 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,942 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,943 INFO L120 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 [2019-10-22 09:02:42,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,943 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,944 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,944 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,947 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:42,948 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:42,948 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:42,948 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:42,948 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:42,948 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:42,949 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-10-22 09:02:42,949 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:43,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:43,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 09:02:43,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380 Second operand 6 states. [2019-10-22 09:02:43,111 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380. Second operand 6 states. Result 783 states and 1151 transitions. Complement of second has 18 states. [2019-10-22 09:02:43,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-10-22 09:02:43,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 51 letters. Loop has 4 letters. [2019-10-22 09:02:43,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,113 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:43,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:43,245 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 09:02:43,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380 Second operand 6 states. [2019-10-22 09:02:43,327 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380. Second operand 6 states. Result 964 states and 1362 transitions. Complement of second has 22 states. [2019-10-22 09:02:43,327 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 [2019-10-22 09:02:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-10-22 09:02:43,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 51 letters. Loop has 4 letters. [2019-10-22 09:02:43,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,328 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:43,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:43,436 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 4 loop predicates [2019-10-22 09:02:43,437 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380 Second operand 6 states. [2019-10-22 09:02:43,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380. Second operand 6 states. Result 1029 states and 1473 transitions. Complement of second has 27 states. [2019-10-22 09:02:43,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-10-22 09:02:43,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-10-22 09:02:43,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 4 letters. [2019-10-22 09:02:43,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 8 letters. [2019-10-22 09:02:43,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1029 states and 1473 transitions. [2019-10-22 09:02:43,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-10-22 09:02:43,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1029 states to 761 states and 1128 transitions. [2019-10-22 09:02:43,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 228 [2019-10-22 09:02:43,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2019-10-22 09:02:43,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 761 states and 1128 transitions. [2019-10-22 09:02:43,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:43,519 INFO L688 BuchiCegarLoop]: Abstraction has 761 states and 1128 transitions. [2019-10-22 09:02:43,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states and 1128 transitions. [2019-10-22 09:02:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-22 09:02:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-22 09:02:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1128 transitions. [2019-10-22 09:02:43,537 INFO L711 BuchiCegarLoop]: Abstraction has 761 states and 1128 transitions. [2019-10-22 09:02:43,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:43,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-22 09:02:43,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2019-10-22 09:02:43,538 INFO L87 Difference]: Start difference. First operand 761 states and 1128 transitions. Second operand 30 states. [2019-10-22 09:02:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:44,008 INFO L93 Difference]: Finished difference Result 395 states and 515 transitions. [2019-10-22 09:02:44,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 09:02:44,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 395 states and 515 transitions. [2019-10-22 09:02:44,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 09:02:44,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 395 states to 361 states and 479 transitions. [2019-10-22 09:02:44,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2019-10-22 09:02:44,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-10-22 09:02:44,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 361 states and 479 transitions. [2019-10-22 09:02:44,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:44,017 INFO L688 BuchiCegarLoop]: Abstraction has 361 states and 479 transitions. [2019-10-22 09:02:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states and 479 transitions. [2019-10-22 09:02:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 317. [2019-10-22 09:02:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-10-22 09:02:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 424 transitions. [2019-10-22 09:02:44,025 INFO L711 BuchiCegarLoop]: Abstraction has 317 states and 424 transitions. [2019-10-22 09:02:44,025 INFO L591 BuchiCegarLoop]: Abstraction has 317 states and 424 transitions. [2019-10-22 09:02:44,025 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:02:44,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 424 transitions. [2019-10-22 09:02:44,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 09:02:44,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:44,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:44,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 11, 10, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-10-22 09:02:44,031 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:44,031 INFO L791 eck$LassoCheckResult]: Stem: 17993#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 17994#L25 call main_#t~ret2 := fibo(main_~x~0);< 18032#fiboENTRY ~n := #in~n; 18115#L6 assume !(~n < 1); 18112#L8 assume !(1 == ~n); 18101#L11 call #t~ret0 := fibo(~n - 1);< 18106#fiboENTRY ~n := #in~n; 18110#L6 assume !(~n < 1); 18108#L8 assume !(1 == ~n); 18103#L11 call #t~ret0 := fibo(~n - 1);< 18104#fiboENTRY ~n := #in~n; 18128#L6 assume !(~n < 1); 18119#L8 assume !(1 == ~n); 18114#L11 call #t~ret0 := fibo(~n - 1);< 18117#fiboENTRY ~n := #in~n; 18138#L6 assume !(~n < 1); 18136#L8 assume !(1 == ~n); 18002#L11 call #t~ret0 := fibo(~n - 1);< 18017#fiboENTRY ~n := #in~n; 18018#L6 assume !(~n < 1); 18001#L8 assume !(1 == ~n); 18003#L11 call #t~ret0 := fibo(~n - 1);< 18131#fiboENTRY ~n := #in~n; 18183#L6 assume !(~n < 1); 18173#L8 assume !(1 == ~n); 18020#L11 call #t~ret0 := fibo(~n - 1);< 18131#fiboENTRY ~n := #in~n; 18183#L6 assume !(~n < 1); 18173#L8 assume !(1 == ~n); 18020#L11 call #t~ret0 := fibo(~n - 1);< 18131#fiboENTRY ~n := #in~n; 18183#L6 assume !(~n < 1); 18173#L8 assume !(1 == ~n); 18020#L11 call #t~ret0 := fibo(~n - 1);< 18168#fiboENTRY ~n := #in~n; 18290#L6 assume !(~n < 1); 18288#L8 assume 1 == ~n;#res := 1; 18287#fiboFINAL assume true; 18286#fiboEXIT >#32#return; 18019#L11-1 call #t~ret1 := fibo(~n - 2);< 18021#fiboENTRY ~n := #in~n; 18222#L6 assume ~n < 1;#res := 0; 18217#fiboFINAL assume true; 18210#fiboEXIT >#34#return; 18197#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 18194#fiboFINAL assume true; 18189#fiboEXIT >#32#return; 18178#L11-1 call #t~ret1 := fibo(~n - 2);< 18181#fiboENTRY ~n := #in~n; 18208#L6 assume !(~n < 1); 18188#L8 assume 1 == ~n;#res := 1; 18185#fiboFINAL assume true; 18177#fiboEXIT >#34#return; 18172#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 18167#fiboFINAL assume true; 18164#fiboEXIT >#32#return; 18123#L11-1 call #t~ret1 := fibo(~n - 2);< 18126#fiboENTRY ~n := #in~n; 18192#L6 assume !(~n < 1); 18187#L8 assume !(1 == ~n); 17986#L11 call #t~ret0 := fibo(~n - 1);< 18086#fiboENTRY ~n := #in~n; 18087#L6 assume !(~n < 1); 18082#L8 assume !(1 == ~n); 18051#L11 call #t~ret0 := fibo(~n - 1);< 18052#fiboENTRY ~n := #in~n; 18071#L6 assume !(~n < 1); 18070#L8 assume !(1 == ~n); 18049#L11 [2019-10-22 09:02:44,031 INFO L793 eck$LassoCheckResult]: Loop: 18049#L11 call #t~ret0 := fibo(~n - 1);< 18052#fiboENTRY ~n := #in~n; 18071#L6 assume !(~n < 1); 18070#L8 assume !(1 == ~n); 18049#L11 [2019-10-22 09:02:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1455011085, now seen corresponding path program 4 times [2019-10-22 09:02:44,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998468408] [2019-10-22 09:02:44,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 37 proven. 271 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-22 09:02:44,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998468408] [2019-10-22 09:02:44,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322262834] [2019-10-22 09:02:44,340 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:44,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 09:02:44,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:44,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:02:44,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 120 proven. 179 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 09:02:44,433 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:44,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 28 [2019-10-22 09:02:44,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119905234] [2019-10-22 09:02:44,434 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2019-10-22 09:02:44,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017316341] [2019-10-22 09:02:44,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,439 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:44,475 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:44,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:44,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:44,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:44,475 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:44,475 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:44,475 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:44,476 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:44,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration9_Loop [2019-10-22 09:02:44,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:44,476 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:44,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,527 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:44,527 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:44,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:44,533 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:44,538 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:44,538 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:44,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:44,545 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:44,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:44,548 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:44,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:44,559 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:44,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:44,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:47,041 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:47,042 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:47,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:47,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:47,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:47,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:47,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:47,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:47,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:47,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration9_Loop [2019-10-22 09:02:47,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:47,043 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:47,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:47,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:47,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:47,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:47,087 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:47,087 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:47,088 INFO L120 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 [2019-10-22 09:02:47,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,089 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,089 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,090 INFO L120 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 [2019-10-22 09:02:47,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,092 INFO L120 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 [2019-10-22 09:02:47,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,096 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:47,097 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:47,097 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:47,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:47,098 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:47,098 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:47,098 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-10-22 09:02:47,098 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:47,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:47,228 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 09:02:47,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111 Second operand 6 states. [2019-10-22 09:02:47,274 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111. Second operand 6 states. Result 336 states and 444 transitions. Complement of second has 18 states. [2019-10-22 09:02:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-10-22 09:02:47,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 68 letters. Loop has 4 letters. [2019-10-22 09:02:47,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,275 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:47,408 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 09:02:47,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111 Second operand 6 states. [2019-10-22 09:02:47,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111. Second operand 6 states. Result 342 states and 450 transitions. Complement of second has 17 states. [2019-10-22 09:02:47,484 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 [2019-10-22 09:02:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-10-22 09:02:47,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 68 letters. Loop has 4 letters. [2019-10-22 09:02:47,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,485 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:47,607 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 4 loop predicates [2019-10-22 09:02:47,607 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111 Second operand 6 states. [2019-10-22 09:02:47,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111. Second operand 6 states. Result 423 states and 554 transitions. Complement of second has 27 states. [2019-10-22 09:02:47,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-10-22 09:02:47,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2019-10-22 09:02:47,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 72 letters. Loop has 4 letters. [2019-10-22 09:02:47,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 8 letters. [2019-10-22 09:02:47,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 554 transitions. [2019-10-22 09:02:47,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 09:02:47,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 325 states and 434 transitions. [2019-10-22 09:02:47,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2019-10-22 09:02:47,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-10-22 09:02:47,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 325 states and 434 transitions. [2019-10-22 09:02:47,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:47,672 INFO L688 BuchiCegarLoop]: Abstraction has 325 states and 434 transitions. [2019-10-22 09:02:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states and 434 transitions. [2019-10-22 09:02:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 317. [2019-10-22 09:02:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-10-22 09:02:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 424 transitions. [2019-10-22 09:02:47,681 INFO L711 BuchiCegarLoop]: Abstraction has 317 states and 424 transitions. [2019-10-22 09:02:47,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:47,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-22 09:02:47,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-10-22 09:02:47,681 INFO L87 Difference]: Start difference. First operand 317 states and 424 transitions. Second operand 28 states. [2019-10-22 09:02:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:48,177 INFO L93 Difference]: Finished difference Result 412 states and 550 transitions. [2019-10-22 09:02:48,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-22 09:02:48,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 550 transitions. [2019-10-22 09:02:48,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 09:02:48,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 404 states and 536 transitions. [2019-10-22 09:02:48,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2019-10-22 09:02:48,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-10-22 09:02:48,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 404 states and 536 transitions. [2019-10-22 09:02:48,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:48,185 INFO L688 BuchiCegarLoop]: Abstraction has 404 states and 536 transitions. [2019-10-22 09:02:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 536 transitions. [2019-10-22 09:02:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 359. [2019-10-22 09:02:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-22 09:02:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 480 transitions. [2019-10-22 09:02:48,194 INFO L711 BuchiCegarLoop]: Abstraction has 359 states and 480 transitions. [2019-10-22 09:02:48,194 INFO L591 BuchiCegarLoop]: Abstraction has 359 states and 480 transitions. [2019-10-22 09:02:48,194 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:02:48,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 359 states and 480 transitions. [2019-10-22 09:02:48,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 09:02:48,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:48,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:48,197 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 12, 11, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-10-22 09:02:48,201 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:48,201 INFO L791 eck$LassoCheckResult]: Stem: 21207#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 21208#L25 call main_#t~ret2 := fibo(main_~x~0);< 21235#fiboENTRY ~n := #in~n; 21343#L6 assume !(~n < 1); 21341#L8 assume !(1 == ~n); 21334#L11 call #t~ret0 := fibo(~n - 1);< 21338#fiboENTRY ~n := #in~n; 21342#L6 assume !(~n < 1); 21339#L8 assume !(1 == ~n); 21318#L11 call #t~ret0 := fibo(~n - 1);< 21336#fiboENTRY ~n := #in~n; 21499#L6 assume !(~n < 1); 21495#L8 assume !(1 == ~n); 21321#L11 call #t~ret0 := fibo(~n - 1);< 21323#fiboENTRY ~n := #in~n; 21364#L6 assume !(~n < 1); 21361#L8 assume !(1 == ~n); 21348#L11 call #t~ret0 := fibo(~n - 1);< 21357#fiboENTRY ~n := #in~n; 21411#L6 assume !(~n < 1); 21401#L8 assume !(1 == ~n); 21394#L11 call #t~ret0 := fibo(~n - 1);< 21397#fiboENTRY ~n := #in~n; 21424#L6 assume !(~n < 1); 21417#L8 assume !(1 == ~n); 21226#L11 call #t~ret0 := fibo(~n - 1);< 21414#fiboENTRY ~n := #in~n; 21434#L6 assume !(~n < 1); 21433#L8 assume !(1 == ~n); 21225#L11 call #t~ret0 := fibo(~n - 1);< 21414#fiboENTRY ~n := #in~n; 21434#L6 assume !(~n < 1); 21433#L8 assume !(1 == ~n); 21225#L11 call #t~ret0 := fibo(~n - 1);< 21414#fiboENTRY ~n := #in~n; 21434#L6 assume !(~n < 1); 21433#L8 assume !(1 == ~n); 21225#L11 call #t~ret0 := fibo(~n - 1);< 21419#fiboENTRY ~n := #in~n; 21551#L6 assume !(~n < 1); 21550#L8 assume 1 == ~n;#res := 1; 21549#fiboFINAL assume true; 21548#fiboEXIT >#32#return; 21224#L11-1 call #t~ret1 := fibo(~n - 2);< 21227#fiboENTRY ~n := #in~n; 21535#L6 assume ~n < 1;#res := 0; 21534#fiboFINAL assume true; 21533#fiboEXIT >#34#return; 21531#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 21529#fiboFINAL assume true; 21528#fiboEXIT >#32#return; 21239#L11-1 call #t~ret1 := fibo(~n - 2);< 21525#fiboENTRY ~n := #in~n; 21546#L6 assume !(~n < 1); 21544#L8 assume 1 == ~n;#res := 1; 21422#fiboFINAL assume true; 21522#fiboEXIT >#34#return; 21521#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 21460#fiboFINAL assume true; 21403#fiboEXIT >#32#return; 21237#L11-1 call #t~ret1 := fibo(~n - 2);< 21409#fiboENTRY ~n := #in~n; 21541#L6 assume !(~n < 1); 21421#L8 assume !(1 == ~n); 21243#L11 call #t~ret0 := fibo(~n - 1);< 21306#fiboENTRY ~n := #in~n; 21299#L6 assume !(~n < 1); 21300#L8 assume !(1 == ~n); 21260#L11 call #t~ret0 := fibo(~n - 1);< 21262#fiboENTRY ~n := #in~n; 21284#L6 assume !(~n < 1); 21280#L8 assume !(1 == ~n); 21261#L11 [2019-10-22 09:02:48,201 INFO L793 eck$LassoCheckResult]: Loop: 21261#L11 call #t~ret0 := fibo(~n - 1);< 21262#fiboENTRY ~n := #in~n; 21284#L6 assume !(~n < 1); 21280#L8 assume !(1 == ~n); 21261#L11 [2019-10-22 09:02:48,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1736707112, now seen corresponding path program 5 times [2019-10-22 09:02:48,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755008045] [2019-10-22 09:02:48,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 218 proven. 112 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-22 09:02:48,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755008045] [2019-10-22 09:02:48,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110721415] [2019-10-22 09:02:48,441 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:48,511 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-22 09:02:48,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:48,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:02:48,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 179 proven. 18 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-22 09:02:48,569 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:48,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 25 [2019-10-22 09:02:48,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067900757] [2019-10-22 09:02:48,573 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2019-10-22 09:02:48,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715925001] [2019-10-22 09:02:48,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:48,579 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:48,614 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:48,614 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:48,614 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:48,614 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:48,614 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:48,614 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:48,614 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:48,614 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:48,615 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration10_Loop [2019-10-22 09:02:48,615 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:48,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:48,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:48,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:48,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:48,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:48,654 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:48,655 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:48,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:48,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:48,662 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:48,663 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:48,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:48,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:48,692 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:48,692 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/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 [2019-10-22 09:02:48,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:48,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:48,700 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:48,701 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:48,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:48,705 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_371ae783-4b6b-4754-ac21-868233e73f56/bin/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:48,718 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:48,718 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:57,651 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:57,653 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:57,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:57,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:57,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:57,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:57,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:57,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:57,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:57,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration10_Loop [2019-10-22 09:02:57,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:57,653 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:57,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:57,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:57,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:57,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:57,685 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:57,685 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:57,686 INFO L120 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 [2019-10-22 09:02:57,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:57,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:57,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:57,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:57,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:57,687 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:57,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:57,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:57,687 INFO L120 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 [2019-10-22 09:02:57,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:57,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:57,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:57,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:57,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:57,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:57,689 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:57,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:57,690 INFO L120 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 [2019-10-22 09:02:57,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:57,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:57,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:57,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:57,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:57,691 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:57,691 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:57,692 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:57,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:57,694 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:57,695 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:57,695 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:57,695 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:57,695 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-10-22 09:02:57,695 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:57,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-22 09:02:57,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:57,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:57,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:57,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:57,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:57,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:57,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:57,825 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 09:02:57,825 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125 Second operand 6 states. [2019-10-22 09:02:57,862 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125. Second operand 6 states. Result 381 states and 503 transitions. Complement of second has 18 states. [2019-10-22 09:02:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-10-22 09:02:57,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 72 letters. Loop has 4 letters. [2019-10-22 09:02:57,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:57,865 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:57,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-22 09:02:57,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:57,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:57,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:57,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:57,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:57,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:57,994 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 09:02:57,994 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125 Second operand 6 states. [2019-10-22 09:02:58,064 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125. Second operand 6 states. Result 387 states and 509 transitions. Complement of second has 17 states. [2019-10-22 09:02:58,064 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 [2019-10-22 09:02:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-10-22 09:02:58,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 72 letters. Loop has 4 letters. [2019-10-22 09:02:58,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:58,065 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:58,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-22 09:02:58,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:58,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:58,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:58,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:58,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:58,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:58,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:58,187 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 4 loop predicates [2019-10-22 09:02:58,187 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125 Second operand 6 states. [2019-10-22 09:02:58,242 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125. Second operand 6 states. Result 490 states and 640 transitions. Complement of second has 27 states. [2019-10-22 09:02:58,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-10-22 09:02:58,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 72 letters. Loop has 4 letters. [2019-10-22 09:02:58,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:58,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 76 letters. Loop has 4 letters. [2019-10-22 09:02:58,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:58,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 72 letters. Loop has 8 letters. [2019-10-22 09:02:58,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:58,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 490 states and 640 transitions. [2019-10-22 09:02:58,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 09:02:58,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 490 states to 371 states and 494 transitions. [2019-10-22 09:02:58,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2019-10-22 09:02:58,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2019-10-22 09:02:58,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 494 transitions. [2019-10-22 09:02:58,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:58,253 INFO L688 BuchiCegarLoop]: Abstraction has 371 states and 494 transitions. [2019-10-22 09:02:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 494 transitions. [2019-10-22 09:02:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2019-10-22 09:02:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-22 09:02:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 480 transitions. [2019-10-22 09:02:58,261 INFO L711 BuchiCegarLoop]: Abstraction has 359 states and 480 transitions. [2019-10-22 09:02:58,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:58,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-22 09:02:58,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-10-22 09:02:58,262 INFO L87 Difference]: Start difference. First operand 359 states and 480 transitions. Second operand 25 states. [2019-10-22 09:02:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:58,679 INFO L93 Difference]: Finished difference Result 495 states and 691 transitions. [2019-10-22 09:02:58,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-22 09:02:58,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 691 transitions. [2019-10-22 09:02:58,684 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:58,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 0 states and 0 transitions. [2019-10-22 09:02:58,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:58,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:58,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:58,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:58,684 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:58,684 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:58,684 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:58,684 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:02:58,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:58,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:58,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:58,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:58 BoogieIcfgContainer [2019-10-22 09:02:58,692 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:58,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:58,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:58,693 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:58,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:26" (3/4) ... [2019-10-22 09:02:58,697 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:58,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:58,705 INFO L168 Benchmark]: Toolchain (without parser) took 32850.85 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.7 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 220.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,705 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:58,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -212.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:58,706 INFO L168 Benchmark]: Boogie Preprocessor took 18.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:58,706 INFO L168 Benchmark]: RCFGBuilder took 222.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,707 INFO L168 Benchmark]: BuchiAutomizer took 32282.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 255.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,707 INFO L168 Benchmark]: Witness Printer took 10.73 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:58,712 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -212.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 222.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 32282.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 255.0 MB. Max. memory is 11.5 GB. * Witness Printer took 10.73 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 17 terminating modules (9 trivial, 3 deterministic, 5 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One deterministic module has affine ranking function n and consists of 7 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 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 9 modules have a trivial ranking function, the largest among these consists of 30 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.2s and 11 iterations. TraceHistogramMax:15. Analysis of lassos took 24.9s. Construction of modules took 1.9s. Büchi inclusion checks took 4.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 402 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 761 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 5, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/26 HoareTripleCheckerStatistics: 350 SDtfs, 971 SDslu, 849 SDs, 0 SdLazy, 2854 SolverSat, 703 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI2 SILT7 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf97 lsp96 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq181 hnf93 smp77 dnf100 smp100 tf109 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 20.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...