./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c -s /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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 64bit --witnessprinter.graph.data.programhash 871be16186d4378aec884efd2352a47ca4eb57bc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:06:42,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:42,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:42,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:42,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:42,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:42,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:42,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:42,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:42,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:42,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:42,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:42,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:42,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:42,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:42,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:42,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:42,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:42,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:43,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:43,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:43,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:43,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:43,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:43,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:43,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:43,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:43,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:43,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:43,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:43,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:43,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:43,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:43,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:43,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:43,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:43,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:43,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:43,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:43,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:43,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:43,031 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:06:43,061 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:43,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:43,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:43,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:43,063 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:43,063 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:06:43,063 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:06:43,063 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:06:43,063 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:06:43,064 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:06:43,064 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:06:43,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:43,064 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:06:43,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:06:43,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:43,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:06:43,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:06:43,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:06:43,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:06:43,065 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:06:43,066 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:43,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:06:43,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:43,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:43,066 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:06:43,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:43,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:06:43,067 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:06:43,068 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:06:43,068 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/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 871be16186d4378aec884efd2352a47ca4eb57bc [2019-11-16 00:06:43,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:43,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:43,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:43,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:43,130 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:43,131 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2019-11-16 00:06:43,193 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/data/b9147591a/8f2c83ae19714273acc79e88563c845e/FLAG1c6b4809c [2019-11-16 00:06:43,584 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:43,585 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2019-11-16 00:06:43,591 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/data/b9147591a/8f2c83ae19714273acc79e88563c845e/FLAG1c6b4809c [2019-11-16 00:06:43,988 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/data/b9147591a/8f2c83ae19714273acc79e88563c845e [2019-11-16 00:06:43,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:43,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:06:43,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:43,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:43,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:43,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:43" (1/1) ... [2019-11-16 00:06:44,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c50c72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44, skipping insertion in model container [2019-11-16 00:06:44,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:43" (1/1) ... [2019-11-16 00:06:44,011 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:44,025 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:44,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:44,174 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:06:44,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:44,283 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:06:44,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44 WrapperNode [2019-11-16 00:06:44,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:44,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:44,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:06:44,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:06:44,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... [2019-11-16 00:06:44,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... [2019-11-16 00:06:44,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:44,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:06:44,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:06:44,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:06:44,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... [2019-11-16 00:06:44,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... [2019-11-16 00:06:44,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... [2019-11-16 00:06:44,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... [2019-11-16 00:06:44,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... [2019-11-16 00:06:44,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... [2019-11-16 00:06:44,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... [2019-11-16 00:06:44,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:06:44,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:06:44,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:06:44,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:06:44,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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-11-16 00:06:44,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:06:44,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:06:44,405 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2019-11-16 00:06:44,407 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2019-11-16 00:06:44,593 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:06:44,593 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:06:44,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:44 BoogieIcfgContainer [2019-11-16 00:06:44,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:06:44,596 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:06:44,596 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:06:44,600 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:06:44,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:06:44,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:06:43" (1/3) ... [2019-11-16 00:06:44,608 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21f58d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:06:44, skipping insertion in model container [2019-11-16 00:06:44,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:06:44,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:44" (2/3) ... [2019-11-16 00:06:44,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21f58d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:06:44, skipping insertion in model container [2019-11-16 00:06:44,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:06:44,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:44" (3/3) ... [2019-11-16 00:06:44,617 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Recursion.c [2019-11-16 00:06:44,682 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:06:44,682 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:06:44,682 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:06:44,683 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:06:44,683 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:06:44,684 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:06:44,684 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:06:44,684 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:06:44,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:06:44,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:44,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:44,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:44,749 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:06:44,749 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:06:44,749 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:06:44,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:06:44,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:44,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:44,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:44,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:06:44,752 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:06:44,761 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 4#L16true call main_#t~ret3 := mc91(main_~x~0);< 5#mc91ENTRYtrue [2019-11-16 00:06:44,761 INFO L793 eck$LassoCheckResult]: Loop: 5#mc91ENTRYtrue ~n := #in~n; 9#L10true assume !(~n > 100); 11#L11true call #t~ret0 := mc91(11 + ~n);< 5#mc91ENTRYtrue [2019-11-16 00:06:44,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:44,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1008, now seen corresponding path program 1 times [2019-11-16 00:06:44,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:44,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806157286] [2019-11-16 00:06:44,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:44,853 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:44,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash 36877, now seen corresponding path program 1 times [2019-11-16 00:06:44,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:44,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095233563] [2019-11-16 00:06:44,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:44,875 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash 30036414, now seen corresponding path program 1 times [2019-11-16 00:06:44,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:44,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476718544] [2019-11-16 00:06:44,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:44,890 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:45,039 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:45,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:45,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:45,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:45,040 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:06:45,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:45,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:45,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:45,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration1_Loop [2019-11-16 00:06:45,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:45,041 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:45,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:45,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:45,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:45,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:45,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:45,157 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:45,158 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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) [2019-11-16 00:06:45,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:45,166 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:45,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:06:45,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:46,447 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:06:46,452 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:46,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:46,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:46,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:46,453 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:46,453 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:46,453 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:46,453 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:46,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration1_Loop [2019-11-16 00:06:46,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:46,454 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:46,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:46,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:46,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:46,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:46,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:46,542 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:46,548 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:46,554 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-11-16 00:06:46,556 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:46,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:46,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:46,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:46,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:46,571 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:46,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:46,593 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:46,619 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:46,621 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:06:46,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:46,624 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:06:46,625 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:46,626 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2019-11-16 00:06:46,632 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:06:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:46,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:46,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:46,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:06:46,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:46,799 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-11-16 00:06:46,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-11-16 00:06:46,952 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 31 states and 38 transitions. Complement of second has 12 states. [2019-11-16 00:06:46,953 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-11-16 00:06:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:06:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-16 00:06:46,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-16 00:06:46,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:46,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-16 00:06:46,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:46,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-16 00:06:46,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:46,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-16 00:06:46,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:46,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 18 states and 24 transitions. [2019-11-16 00:06:46,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:06:46,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:06:46,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-11-16 00:06:46,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:46,977 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-16 00:06:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-11-16 00:06:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-16 00:06:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:06:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-16 00:06:47,023 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-16 00:06:47,023 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-16 00:06:47,023 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:06:47,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-16 00:06:47,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:47,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:47,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:47,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:47,028 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:47,029 INFO L791 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 96#L16 call main_#t~ret3 := mc91(main_~x~0);< 101#mc91ENTRY ~n := #in~n; 105#L10 assume !(~n > 100); 98#L11 call #t~ret0 := mc91(11 + ~n);< 107#mc91ENTRY ~n := #in~n; 103#L10 assume ~n > 100;#res := ~n - 10; 104#mc91FINAL assume true; 102#mc91EXIT >#19#return; 97#L11-1 [2019-11-16 00:06:47,029 INFO L793 eck$LassoCheckResult]: Loop: 97#L11-1 call #t~ret1 := mc91(#t~ret0);< 106#mc91ENTRY ~n := #in~n; 109#L10 assume !(~n > 100); 95#L11 call #t~ret0 := mc91(11 + ~n);< 106#mc91ENTRY ~n := #in~n; 109#L10 assume ~n > 100;#res := ~n - 10; 99#mc91FINAL assume true; 108#mc91EXIT >#19#return; 97#L11-1 [2019-11-16 00:06:47,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:47,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1934452539, now seen corresponding path program 1 times [2019-11-16 00:06:47,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:47,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334543701] [2019-11-16 00:06:47,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:47,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:47,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:47,048 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:47,049 INFO L82 PathProgramCache]: Analyzing trace with hash 938335010, now seen corresponding path program 1 times [2019-11-16 00:06:47,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:47,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437471581] [2019-11-16 00:06:47,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:47,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:47,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:47,068 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash 418213862, now seen corresponding path program 1 times [2019-11-16 00:06:47,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:47,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423462110] [2019-11-16 00:06:47,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:47,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:47,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:47,107 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:47,237 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:47,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:47,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:47,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:47,237 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:06:47,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:47,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:47,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:47,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration2_Loop [2019-11-16 00:06:47,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:47,238 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:47,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-11-16 00:06:47,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:47,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:47,335 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:47,336 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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-11-16 00:06:47,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:47,342 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-11-16 00:06:47,348 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:47,349 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:47,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:47,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:47,377 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:47,377 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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-11-16 00:06:47,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:47,382 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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) [2019-11-16 00:06:47,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:06:47,408 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:59,466 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-11-16 00:06:59,470 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:59,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:59,470 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:59,470 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:59,470 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:59,470 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:59,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:59,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:59,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration2_Loop [2019-11-16 00:06:59,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:59,471 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:59,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:59,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:59,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:59,549 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:59,550 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:59,550 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-11-16 00:06:59,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:59,551 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:59,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:59,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:59,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:59,552 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:59,552 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:59,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:59,554 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-11-16 00:06:59,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:59,554 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:59,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:59,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:59,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:59,555 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:59,555 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:59,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:59,557 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-11-16 00:06:59,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:59,558 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:59,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:59,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:59,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:59,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:59,559 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:59,569 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:59,580 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:59,580 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:06:59,581 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:59,581 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:06:59,581 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:59,581 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2019-11-16 00:06:59,582 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:06:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:59,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:06:59,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:59,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:06:59,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:59,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-11-16 00:06:59,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 9 states. [2019-11-16 00:07:00,340 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 50 states and 72 transitions. Complement of second has 32 states. [2019-11-16 00:07:00,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-16 00:07:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:07:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-11-16 00:07:00,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2019-11-16 00:07:00,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:00,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2019-11-16 00:07:00,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:00,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2019-11-16 00:07:00,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:00,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 72 transitions. [2019-11-16 00:07:00,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:07:00,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 61 transitions. [2019-11-16 00:07:00,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:07:00,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:07:00,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 61 transitions. [2019-11-16 00:07:00,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:07:00,370 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-11-16 00:07:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 61 transitions. [2019-11-16 00:07:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-11-16 00:07:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-16 00:07:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-11-16 00:07:00,384 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-11-16 00:07:00,384 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-11-16 00:07:00,384 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:07:00,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2019-11-16 00:07:00,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:07:00,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:07:00,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:07:00,386 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:00,387 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:07:00,387 INFO L791 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 283#L16 call main_#t~ret3 := mc91(main_~x~0);< 289#mc91ENTRY ~n := #in~n; 295#L10 assume !(~n > 100); 284#L11 call #t~ret0 := mc91(11 + ~n);< 297#mc91ENTRY ~n := #in~n; 300#L10 assume ~n > 100;#res := ~n - 10; 306#mc91FINAL assume true; 305#mc91EXIT >#19#return; 277#L11-1 call #t~ret1 := mc91(#t~ret0);< 292#mc91ENTRY ~n := #in~n; 309#L10 assume !(~n > 100); 294#L11 [2019-11-16 00:07:00,387 INFO L793 eck$LassoCheckResult]: Loop: 294#L11 call #t~ret0 := mc91(11 + ~n);< 296#mc91ENTRY ~n := #in~n; 293#L10 assume !(~n > 100); 294#L11 [2019-11-16 00:07:00,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:00,387 INFO L82 PathProgramCache]: Analyzing trace with hash 595607827, now seen corresponding path program 2 times [2019-11-16 00:07:00,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:00,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522048604] [2019-11-16 00:07:00,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:00,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:00,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:00,424 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:07:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:00,425 INFO L82 PathProgramCache]: Analyzing trace with hash 47317, now seen corresponding path program 2 times [2019-11-16 00:07:00,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:00,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574316288] [2019-11-16 00:07:00,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:00,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:00,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:00,431 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:07:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891907, now seen corresponding path program 3 times [2019-11-16 00:07:00,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:00,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534566514] [2019-11-16 00:07:00,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:00,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:00,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:07:00,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534566514] [2019-11-16 00:07:00,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:00,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:07:00,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778363245] [2019-11-16 00:07:00,590 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:07:00,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:07:00,590 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:07:00,590 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:07:00,591 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:07:00,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:00,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:07:00,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:07:00,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration3_Loop [2019-11-16 00:07:00,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:07:00,591 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:07:00,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:00,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:00,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:00,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:00,641 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:07:00,641 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:00,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:07:00,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:07:00,654 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:07:00,655 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:07:00,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:07:00,669 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:00,673 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:07:00,673 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret0=0} Honda state: {mc91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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-11-16 00:07:00,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:07:00,686 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/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:00,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:07:00,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:07:12,720 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-11-16 00:07:12,724 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:07:12,724 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:07:12,724 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:07:12,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:07:12,724 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:07:12,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:12,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:07:12,725 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:07:12,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration3_Loop [2019-11-16 00:07:12,725 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:07:12,725 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:07:12,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:12,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:12,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:12,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:12,786 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:07:12,786 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:07:12,786 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-11-16 00:07:12,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:07:12,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:07:12,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:07:12,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:07:12,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:07:12,788 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:07:12,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:07:12,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:07:12,790 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-11-16 00:07:12,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:07:12,791 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:07:12,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:07:12,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:07:12,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:07:12,792 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:07:12,792 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:07:12,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:07:12,793 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-11-16 00:07:12,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:07:12,794 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:07:12,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:07:12,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:07:12,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:07:12,795 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:07:12,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:07:12,800 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:07:12,816 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:07:12,817 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:07:12,817 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:07:12,817 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:07:12,817 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:07:12,818 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_~n) = -2*mc91_~n + 189 Supporting invariants [] [2019-11-16 00:07:12,818 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:07:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:12,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:07:12,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:12,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:07:12,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:12,938 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-11-16 00:07:12,938 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-16 00:07:25,076 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2019-11-16 00:07:25,078 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-11-16 00:07:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:07:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-11-16 00:07:25,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-16 00:07:25,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:25,079 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:07:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:07:25,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:07:25,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:25,196 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-11-16 00:07:25,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-16 00:07:25,365 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2019-11-16 00:07:25,368 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-11-16 00:07:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:07:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-11-16 00:07:25,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-16 00:07:25,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:25,370 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:07:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:07:25,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:07:25,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:25,497 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-11-16 00:07:25,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-16 00:07:25,626 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 70 states and 99 transitions. Complement of second has 16 states. [2019-11-16 00:07:25,626 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-11-16 00:07:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:07:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-11-16 00:07:25,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-16 00:07:25,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:25,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-16 00:07:25,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:25,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 6 letters. [2019-11-16 00:07:25,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:25,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 99 transitions. [2019-11-16 00:07:25,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:07:25,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 73 transitions. [2019-11-16 00:07:25,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:07:25,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-16 00:07:25,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2019-11-16 00:07:25,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:07:25,636 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2019-11-16 00:07:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2019-11-16 00:07:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-11-16 00:07:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-16 00:07:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2019-11-16 00:07:25,643 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2019-11-16 00:07:25,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:25,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:07:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:25,647 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand 8 states. [2019-11-16 00:07:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:25,769 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-11-16 00:07:25,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:07:25,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2019-11-16 00:07:25,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-16 00:07:25,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 74 transitions. [2019-11-16 00:07:25,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-16 00:07:25,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-16 00:07:25,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 74 transitions. [2019-11-16 00:07:25,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:07:25,777 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2019-11-16 00:07:25,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 74 transitions. [2019-11-16 00:07:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-16 00:07:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-16 00:07:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2019-11-16 00:07:25,783 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-11-16 00:07:25,784 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-11-16 00:07:25,784 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:07:25,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2019-11-16 00:07:25,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-16 00:07:25,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:07:25,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:07:25,787 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-16 00:07:25,788 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2019-11-16 00:07:25,788 INFO L791 eck$LassoCheckResult]: Stem: 818#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 819#L16 call main_#t~ret3 := mc91(main_~x~0);< 820#mc91ENTRY ~n := #in~n; 846#L10 assume !(~n > 100); 839#L11 call #t~ret0 := mc91(11 + ~n);< 841#mc91ENTRY ~n := #in~n; 844#L10 assume !(~n > 100); 838#L11 call #t~ret0 := mc91(11 + ~n);< 842#mc91ENTRY ~n := #in~n; 845#L10 assume ~n > 100;#res := ~n - 10; 843#mc91FINAL assume true; 840#mc91EXIT >#19#return; 810#L11-1 call #t~ret1 := mc91(#t~ret0);< 825#mc91ENTRY ~n := #in~n; 859#L10 assume ~n > 100;#res := ~n - 10; 858#mc91FINAL assume true; 855#mc91EXIT >#21#return; 815#L11-2 #res := #t~ret1;havoc #t~ret1;havoc #t~ret0; 853#mc91FINAL assume true; 852#mc91EXIT >#19#return; 814#L11-1 call #t~ret1 := mc91(#t~ret0);< 851#mc91ENTRY [2019-11-16 00:07:25,788 INFO L793 eck$LassoCheckResult]: Loop: 851#mc91ENTRY ~n := #in~n; 847#L10 assume !(~n > 100); 822#L11 call #t~ret0 := mc91(11 + ~n);< 831#mc91ENTRY ~n := #in~n; 828#L10 assume !(~n > 100); 821#L11 call #t~ret0 := mc91(11 + ~n);< 832#mc91ENTRY ~n := #in~n; 826#L10 assume ~n > 100;#res := ~n - 10; 827#mc91FINAL assume true; 833#mc91EXIT >#19#return; 807#L11-1 call #t~ret1 := mc91(#t~ret0);< 823#mc91ENTRY ~n := #in~n; 849#L10 assume ~n > 100;#res := ~n - 10; 850#mc91FINAL assume true; 854#mc91EXIT >#21#return; 815#L11-2 #res := #t~ret1;havoc #t~ret1;havoc #t~ret0; 853#mc91FINAL assume true; 852#mc91EXIT >#19#return; 813#L11-1 call #t~ret1 := mc91(#t~ret0);< 851#mc91ENTRY [2019-11-16 00:07:25,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash -104606680, now seen corresponding path program 1 times [2019-11-16 00:07:25,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:25,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982394793] [2019-11-16 00:07:25,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:25,807 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:07:25,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:25,808 INFO L82 PathProgramCache]: Analyzing trace with hash -735472521, now seen corresponding path program 1 times [2019-11-16 00:07:25,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:25,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012451700] [2019-11-16 00:07:25,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:25,824 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:07:25,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:25,824 INFO L82 PathProgramCache]: Analyzing trace with hash -726341392, now seen corresponding path program 2 times [2019-11-16 00:07:25,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:25,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511719538] [2019-11-16 00:07:25,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:07:25,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511719538] [2019-11-16 00:07:25,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426686565] [2019-11-16 00:07:25,984 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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-11-16 00:07:26,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:07:26,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:26,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:07:26,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:07:26,080 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:26,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-16 00:07:26,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483935500] [2019-11-16 00:07:26,339 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:07:26,340 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:07:26,340 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:07:26,340 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:07:26,340 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:07:26,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:26,340 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:07:26,340 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:07:26,340 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration4_Loop [2019-11-16 00:07:26,340 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:07:26,340 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:07:26,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:26,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:26,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:26,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:26,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:26,396 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:07:26,396 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:07:26,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:07:26,406 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:26,410 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:07:26,411 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret0=0} Honda state: {mc91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:07:26,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:07:26,421 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:26,427 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:07:26,427 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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) [2019-11-16 00:07:26,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:07:26,437 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:26,445 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:07:26,445 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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) [2019-11-16 00:07:26,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:07:26,470 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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-11-16 00:07:26,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:07:26,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:07:26,963 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:07:26,966 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:07:26,966 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:07:26,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:07:26,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:07:26,966 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:07:26,966 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:26,966 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:07:26,966 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:07:26,966 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration4_Loop [2019-11-16 00:07:26,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:07:26,967 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:07:26,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:26,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:26,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:26,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07: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-11-16 00:07:27,035 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:07:27,036 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:07:27,036 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-11-16 00:07:27,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:07:27,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:07:27,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:07:27,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:07:27,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:07:27,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:07:27,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:07:27,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:07:27,039 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-11-16 00:07:27,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:07:27,040 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:07:27,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:07:27,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:07:27,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:07:27,040 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:07:27,041 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:07:27,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:07:27,042 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-11-16 00:07:27,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:07:27,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:07:27,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:07:27,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:07:27,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:07:27,044 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:07:27,045 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:07:27,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:07:27,046 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-11-16 00:07:27,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:07:27,047 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:07:27,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:07:27,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:07:27,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:07:27,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:07:27,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:07:27,057 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:07:27,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:07:27,060 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:07:27,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:07:27,060 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:07:27,061 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:07:27,061 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -1*mc91_#in~n + 90 Supporting invariants [] [2019-11-16 00:07:27,062 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:07:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:07:27,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:27,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:27,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:07:27,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:07:27,399 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2019-11-16 00:07:27,399 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2019-11-16 00:07:27,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2019-11-16 00:07:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-16 00:07:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:07:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2019-11-16 00:07:27,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2019-11-16 00:07:27,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:27,959 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:07:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:28,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:07:28,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:28,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:28,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:07:28,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:07:28,231 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2019-11-16 00:07:28,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2019-11-16 00:07:28,641 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2019-11-16 00:07:28,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-16 00:07:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:07:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2019-11-16 00:07:28,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2019-11-16 00:07:28,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:28,643 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:07:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:28,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:07:28,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:28,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:28,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:07:28,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:07:28,916 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 10 loop predicates [2019-11-16 00:07:28,916 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2019-11-16 00:07:29,705 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 430 states and 530 transitions. Complement of second has 216 states. [2019-11-16 00:07:29,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 17 non-accepting loop states 1 accepting loop states [2019-11-16 00:07:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:07:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 48 transitions. [2019-11-16 00:07:29,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 19 letters. [2019-11-16 00:07:29,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:29,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 40 letters. Loop has 19 letters. [2019-11-16 00:07:29,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:29,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 38 letters. [2019-11-16 00:07:29,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:29,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 530 transitions. [2019-11-16 00:07:29,727 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2019-11-16 00:07:29,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 202 states and 268 transitions. [2019-11-16 00:07:29,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-11-16 00:07:29,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-16 00:07:29,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 268 transitions. [2019-11-16 00:07:29,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:07:29,735 INFO L688 BuchiCegarLoop]: Abstraction has 202 states and 268 transitions. [2019-11-16 00:07:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 268 transitions. [2019-11-16 00:07:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 156. [2019-11-16 00:07:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-16 00:07:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2019-11-16 00:07:29,755 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 197 transitions. [2019-11-16 00:07:29,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:29,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:07:29,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:07:29,755 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand 11 states. [2019-11-16 00:07:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:29,979 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2019-11-16 00:07:29,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:07:29,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 187 transitions. [2019-11-16 00:07:29,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-16 00:07:29,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 103 states and 122 transitions. [2019-11-16 00:07:29,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2019-11-16 00:07:29,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-11-16 00:07:29,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 122 transitions. [2019-11-16 00:07:29,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:07:29,987 INFO L688 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2019-11-16 00:07:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 122 transitions. [2019-11-16 00:07:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-11-16 00:07:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-16 00:07:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2019-11-16 00:07:29,996 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-11-16 00:07:29,996 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-11-16 00:07:29,996 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:07:29,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 118 transitions. [2019-11-16 00:07:30,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-16 00:07:30,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:07:30,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:07:30,004 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2019-11-16 00:07:30,005 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:30,005 INFO L791 eck$LassoCheckResult]: Stem: 2845#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 2846#L16 call main_#t~ret3 := mc91(main_~x~0);< 2847#mc91ENTRY ~n := #in~n; 2854#L10 assume !(~n > 100); 2855#L11 call #t~ret0 := mc91(11 + ~n);< 2877#mc91ENTRY ~n := #in~n; 2879#L10 assume !(~n > 100); 2878#L11 call #t~ret0 := mc91(11 + ~n);< 2896#mc91ENTRY ~n := #in~n; 2898#L10 assume ~n > 100;#res := ~n - 10; 2897#mc91FINAL assume true; 2895#mc91EXIT >#19#return; 2891#L11-1 call #t~ret1 := mc91(#t~ret0);< 2893#mc91ENTRY ~n := #in~n; 2910#L10 assume ~n > 100;#res := ~n - 10; 2899#mc91FINAL assume true; 2890#mc91EXIT >#21#return; 2889#L11-2 #res := #t~ret1;havoc #t~ret1;havoc #t~ret0; 2887#mc91FINAL assume true; 2886#mc91EXIT >#19#return; 2880#L11-1 call #t~ret1 := mc91(#t~ret0);< 2885#mc91ENTRY ~n := #in~n; 2883#L10 assume !(~n > 100); 2848#L11 call #t~ret0 := mc91(11 + ~n);< 2858#mc91ENTRY ~n := #in~n; 2888#L10 assume !(~n > 100); 2840#L11 call #t~ret0 := mc91(11 + ~n);< 2859#mc91ENTRY ~n := #in~n; 2864#L10 assume ~n > 100;#res := ~n - 10; 2929#mc91FINAL assume true; 2839#mc91EXIT >#19#return; 2841#L11-1 [2019-11-16 00:07:30,006 INFO L793 eck$LassoCheckResult]: Loop: 2841#L11-1 call #t~ret1 := mc91(#t~ret0);< 2849#mc91ENTRY ~n := #in~n; 2926#L10 assume !(~n > 100); 2856#L11 call #t~ret0 := mc91(11 + ~n);< 2857#mc91ENTRY ~n := #in~n; 2931#L10 assume ~n > 100;#res := ~n - 10; 2930#mc91FINAL assume true; 2928#mc91EXIT >#19#return; 2841#L11-1 [2019-11-16 00:07:30,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1788916079, now seen corresponding path program 3 times [2019-11-16 00:07:30,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:30,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231092500] [2019-11-16 00:07:30,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-16 00:07:30,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231092500] [2019-11-16 00:07:30,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605742035] [2019-11-16 00:07:30,114 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:30,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-16 00:07:30,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:30,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:07:30,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:07:30,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:30,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2019-11-16 00:07:30,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961633871] [2019-11-16 00:07:30,169 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:07:30,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:30,169 INFO L82 PathProgramCache]: Analyzing trace with hash 938335010, now seen corresponding path program 2 times [2019-11-16 00:07:30,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:30,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094831087] [2019-11-16 00:07:30,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:07:30,175 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:07:30,263 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:07:30,263 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:07:30,263 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:07:30,263 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:07:30,263 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:07:30,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:30,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:07:30,263 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:07:30,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration5_Loop [2019-11-16 00:07:30,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:07:30,263 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:07:30,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:30,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:30,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:30,302 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:07:30,302 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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-11-16 00:07:30,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:07:30,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:07:30,311 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:07:30,311 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:30,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:07:30,316 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f0e947-70cc-4975-8693-ed97908859c8/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-11-16 00:07:30,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:07:30,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:07:42,359 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-11-16 00:07:42,363 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:07:42,363 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:07:42,364 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:07:42,364 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:07:42,364 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:07:42,364 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:07:42,364 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:07:42,364 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:07:42,364 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration5_Loop [2019-11-16 00:07:42,364 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:07:42,364 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:07:42,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:42,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:42,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:07:42,405 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:07:42,405 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:07:42,405 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-11-16 00:07:42,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:07:42,406 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:07:42,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:07:42,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:07:42,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:07:42,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:07:42,407 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:07:42,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:07:42,407 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-11-16 00:07:42,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:07:42,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:07:42,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:07:42,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:07:42,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:07:42,408 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:07:42,408 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:07:42,410 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:07:42,412 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:07:42,413 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:07:42,413 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:07:42,413 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:07:42,413 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:07:42,413 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2019-11-16 00:07:42,414 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:07:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:42,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:07:42,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:42,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:42,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:42,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:07:42,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:42,594 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-11-16 00:07:42,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2019-11-16 00:07:42,861 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2019-11-16 00:07:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-16 00:07:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:07:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-11-16 00:07:42,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2019-11-16 00:07:42,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:42,864 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:07:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:42,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:07:42,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:42,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:42,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:07:42,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:43,062 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2019-11-16 00:07:43,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2019-11-16 00:07:43,300 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2019-11-16 00:07:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-16 00:07:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:07:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-11-16 00:07:43,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2019-11-16 00:07:43,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:43,301 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:07:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:43,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:07:43,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:43,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:43,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:43,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:07:43,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:43,481 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-11-16 00:07:43,481 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2019-11-16 00:07:43,700 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 180 states and 210 transitions. Complement of second has 27 states. [2019-11-16 00:07:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-16 00:07:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:07:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2019-11-16 00:07:43,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 8 letters. [2019-11-16 00:07:43,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:43,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 39 letters. Loop has 8 letters. [2019-11-16 00:07:43,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:43,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 16 letters. [2019-11-16 00:07:43,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:07:43,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 210 transitions. [2019-11-16 00:07:43,710 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:07:43,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 0 states and 0 transitions. [2019-11-16 00:07:43,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:07:43,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:07:43,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:07:43,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:07:43,711 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:07:43,711 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:07:43,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:07:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:07:43,711 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 9 states. [2019-11-16 00:07:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:43,712 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-16 00:07:43,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:07:43,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-16 00:07:43,712 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:07:43,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:07:43,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:07:43,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:07:43,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:07:43,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:07:43,713 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:07:43,713 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:07:43,713 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:07:43,713 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:07:43,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:07:43,713 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:07:43,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:07:43,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:07:43 BoogieIcfgContainer [2019-11-16 00:07:43,719 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:07:43,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:07:43,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:07:43,719 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:07:43,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:44" (3/4) ... [2019-11-16 00:07:43,723 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:07:43,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:07:43,725 INFO L168 Benchmark]: Toolchain (without parser) took 59732.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:07:43,725 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:07:43,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:07:43,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:07:43,726 INFO L168 Benchmark]: Boogie Preprocessor took 14.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:07:43,727 INFO L168 Benchmark]: RCFGBuilder took 266.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:07:43,727 INFO L168 Benchmark]: BuchiAutomizer took 59123.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:07:43,728 INFO L168 Benchmark]: Witness Printer took 3.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 612.2 kB). Peak memory consumption was 612.2 kB. Max. memory is 11.5 GB. [2019-11-16 00:07:43,731 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.66 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 266.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 59123.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 612.2 kB). Peak memory consumption was 612.2 kB. 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 8 terminating modules (3 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -2 * \old(n) + 211 and consists of 4 locations. One deterministic module has affine ranking function -2 * aux-mc91(n+11)-aux + 201 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * n + 189 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(n) + 90 and consists of 20 locations. One nondeterministic module has affine ranking function -2 * aux-mc91(n+11)-aux + 201 and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 59.0s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 40.5s. Construction of modules took 13.2s. Büchi inclusion checks took 4.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 99 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/24 HoareTripleCheckerStatistics: 154 SDtfs, 272 SDslu, 161 SDs, 0 SdLazy, 745 SolverSat, 236 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf96 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf92 smp100 dnf100 smp100 tf109 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 75ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 38.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...