./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive/Ackermann02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Ackermann02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd82318ec795f8c5ba1d6bd1e94de4995b910941 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:26:02,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:26:02,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:26:02,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:26:02,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:26:02,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:26:02,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:26:02,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:26:02,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:26:02,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:26:02,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:26:02,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:26:02,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:26:02,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:26:02,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:26:02,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:26:02,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:26:02,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:26:02,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:26:02,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:26:02,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:26:02,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:26:02,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:26:02,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:26:02,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:26:02,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:26:02,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:26:02,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:26:02,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:26:02,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:26:02,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:26:02,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:26:02,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:26:02,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:26:02,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:26:02,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:26:02,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:26:02,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:26:02,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:26:02,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:26:02,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:26:02,517 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:26:02,535 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:26:02,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:26:02,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:26:02,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:26:02,537 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:26:02,537 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:26:02,538 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:26:02,538 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:26:02,538 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:26:02,538 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:26:02,539 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:26:02,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:26:02,539 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:26:02,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:26:02,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:26:02,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:26:02,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:26:02,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:26:02,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:26:02,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:26:02,541 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:26:02,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:26:02,542 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:26:02,542 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:26:02,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:26:02,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:26:02,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:26:02,543 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:26:02,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:26:02,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:26:02,544 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:26:02,545 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:26:02,546 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_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd82318ec795f8c5ba1d6bd1e94de4995b910941 [2019-11-16 00:26:02,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:26:02,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:26:02,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:26:02,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:26:02,591 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:26:02,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/../../sv-benchmarks/c/recursive/Ackermann02.c [2019-11-16 00:26:02,652 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/data/d55c76685/bccf96499a3c4a65a43f17326127caee/FLAG736fa7133 [2019-11-16 00:26:03,057 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:26:03,057 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/sv-benchmarks/c/recursive/Ackermann02.c [2019-11-16 00:26:03,064 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/data/d55c76685/bccf96499a3c4a65a43f17326127caee/FLAG736fa7133 [2019-11-16 00:26:03,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/data/d55c76685/bccf96499a3c4a65a43f17326127caee [2019-11-16 00:26:03,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:26:03,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:26:03,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:03,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:26:03,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:26:03,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:03" (1/1) ... [2019-11-16 00:26:03,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@538b3fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03, skipping insertion in model container [2019-11-16 00:26:03,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:03" (1/1) ... [2019-11-16 00:26:03,505 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:26:03,522 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:26:03,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:03,743 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:26:03,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:03,781 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:26:03,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03 WrapperNode [2019-11-16 00:26:03,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:03,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:03,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:26:03,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:26:03,790 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:26:03" (1/1) ... [2019-11-16 00:26:03,795 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:26:03" (1/1) ... [2019-11-16 00:26:03,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:03,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:26:03,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:26:03,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:26:03,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03" (1/1) ... [2019-11-16 00:26:03,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03" (1/1) ... [2019-11-16 00:26:03,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03" (1/1) ... [2019-11-16 00:26:03,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03" (1/1) ... [2019-11-16 00:26:03,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03" (1/1) ... [2019-11-16 00:26:03,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03" (1/1) ... [2019-11-16 00:26:03,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03" (1/1) ... [2019-11-16 00:26:03,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:26:03,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:26:03,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:26:03,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:26:03,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:26:03,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:26:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-11-16 00:26:03,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-11-16 00:26:04,223 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:26:04,224 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:26:04,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:04 BoogieIcfgContainer [2019-11-16 00:26:04,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:26:04,226 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:26:04,226 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:26:04,230 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:26:04,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:26:04,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:26:03" (1/3) ... [2019-11-16 00:26:04,238 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@373d9f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:26:04, skipping insertion in model container [2019-11-16 00:26:04,238 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:26:04,238 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:03" (2/3) ... [2019-11-16 00:26:04,239 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@373d9f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:26:04, skipping insertion in model container [2019-11-16 00:26:04,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:26:04,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:04" (3/3) ... [2019-11-16 00:26:04,242 INFO L371 chiAutomizerObserver]: Analyzing ICFG Ackermann02.c [2019-11-16 00:26:04,313 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:26:04,314 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:26:04,314 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:26:04,314 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:26:04,314 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:26:04,315 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:26:04,315 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:26:04,315 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:26:04,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-16 00:26:04,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:26:04,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:04,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:04,395 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:26:04,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:26:04,396 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:26:04,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-16 00:26:04,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:26:04,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:04,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:04,403 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:26:04,403 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:26:04,412 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 3#L27true assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 16#L33true assume !(main_~n~0 < 0 || main_~n~0 > 23); 6#L39true call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 11#ackermannENTRYtrue [2019-11-16 00:26:04,412 INFO L793 eck$LassoCheckResult]: Loop: 11#ackermannENTRYtrue ~m := #in~m;~n := #in~n; 18#L15true assume !(0 == ~m); 12#L18true assume !(0 == ~n); 5#L21true call #t~ret1 := ackermann(~m, ~n - 1);< 11#ackermannENTRYtrue [2019-11-16 00:26:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:04,420 INFO L82 PathProgramCache]: Analyzing trace with hash 959458, now seen corresponding path program 1 times [2019-11-16 00:26:04,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:04,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630954297] [2019-11-16 00:26:04,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:04,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:04,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:04,566 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:04,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1666510, now seen corresponding path program 1 times [2019-11-16 00:26:04,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:04,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107576967] [2019-11-16 00:26:04,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:04,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:04,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:04,596 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:04,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1317091631, now seen corresponding path program 1 times [2019-11-16 00:26:04,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:04,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940406642] [2019-11-16 00:26:04,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:04,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:04,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:04,661 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:04,808 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:04,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:04,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:04,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:04,810 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:04,810 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:04,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:04,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:04,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration1_Loop [2019-11-16 00:26:04,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:04,812 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:04,836 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:26:04,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:04,848 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:26:04,855 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:26:04,858 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:26:04,862 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:26:04,865 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:26:04,875 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:26:05,044 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-11-16 00:26:05,155 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:05,156 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:05,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,171 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 [2019-11-16 00:26:05,180 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,181 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:05,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,207 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,207 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:05,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,215 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,216 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:05,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,226 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,227 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:05,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,245 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,245 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:05,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,258 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:26:05,262 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,263 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:05,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,282 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:05,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:05,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,378 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,378 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-4} Honda state: {ackermann_#in~n=-4} Generalized eigenvectors: [{ackermann_#in~n=-1}, {ackermann_#in~n=0}, {ackermann_#in~n=0}] Lambdas: [1, 2, 5] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:05,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,395 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,395 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7} Honda state: {ackermann_#in~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-11-16 00:26:05,492 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:05,492 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:05,492 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:05,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:05,493 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:05,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:05,493 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:05,493 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:05,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration1_Lasso [2019-11-16 00:26:05,493 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:05,494 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:05,496 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:26:05,502 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:26:05,504 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:26:05,507 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:26:05,510 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:26:05,528 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:26:05,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:05,535 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:26:05,537 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:26:05,540 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:26:05,549 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:26:05,552 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:26:05,555 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:26:05,558 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:26:05,565 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:26:05,579 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:26:05,716 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:05,717 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:05,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,742 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,747 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,747 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:05,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,763 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,763 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:05,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,782 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,783 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:05,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:05,809 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:05,809 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:05,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:05,826 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:05,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:05,851 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 [2019-11-16 00:26:06,559 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:26:06,561 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:06,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:06,562 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:06,562 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:06,562 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:26:06,562 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:06,562 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:06,562 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:06,562 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration1_Lasso [2019-11-16 00:26:06,562 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:06,562 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:06,565 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:26:06,570 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:26:06,576 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:26:06,580 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:26:06,582 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:26:06,591 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:26:06,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:26:06,599 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:26:06,602 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:26:06,604 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:26:06,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:26:06,608 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:26:06,610 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:26:06,613 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:26:06,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:06,635 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:26:06,799 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:06,804 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:26:06,807 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:26:06,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:06,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:06,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:06,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:06,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:06,813 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:06,813 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:06,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:06,818 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:26:06,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:06,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:06,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:06,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:06,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:06,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:06,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:06,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:06,826 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:26:06,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:06,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:06,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:06,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:06,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:06,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:06,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:06,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:06,846 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:26:06,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:06,847 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:06,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:06,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:06,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:06,850 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:06,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:06,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:06,864 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:26:06,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:06,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:06,866 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:26:06,866 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:06,874 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:26:06,877 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:26:07,042 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:26:07,148 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-16 00:26:07,148 INFO L444 ModelExtractionUtils]: 3 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:26:07,151 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:26:07,169 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-11-16 00:26:07,170 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:26:07,171 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = 1*ackermann_#in~n Supporting invariants [1*ackermann_#in~n >= 0] [2019-11-16 00:26:07,180 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-16 00:26:07,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:07,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:26:07,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:07,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:26:07,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:07,337 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:26:07,359 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:26:07,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 5 states. [2019-11-16 00:26:07,542 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 5 states. Result 49 states and 64 transitions. Complement of second has 13 states. [2019-11-16 00:26:07,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:26:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-11-16 00:26:07,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:26:07,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:07,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-16 00:26:07,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:07,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2019-11-16 00:26:07,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:07,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2019-11-16 00:26:07,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:26:07,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 30 states and 41 transitions. [2019-11-16 00:26:07,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-16 00:26:07,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-16 00:26:07,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-11-16 00:26:07,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:07,567 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-11-16 00:26:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-11-16 00:26:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-11-16 00:26:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:26:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-16 00:26:07,595 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-16 00:26:07,595 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-16 00:26:07,595 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:26:07,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2019-11-16 00:26:07,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:26:07,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:07,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:07,598 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:07,598 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:26:07,598 INFO L791 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 140#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 141#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 148#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 150#ackermannENTRY ~m := #in~m;~n := #in~n; 154#L15 assume !(0 == ~m); 165#L18 assume 0 == ~n; 143#L19 call #t~ret0 := ackermann(~m - 1, 1);< 146#ackermannENTRY [2019-11-16 00:26:07,598 INFO L793 eck$LassoCheckResult]: Loop: 146#ackermannENTRY ~m := #in~m;~n := #in~n; 163#L15 assume !(0 == ~m); 162#L18 assume 0 == ~n; 145#L19 call #t~ret0 := ackermann(~m - 1, 1);< 146#ackermannENTRY [2019-11-16 00:26:07,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1317091536, now seen corresponding path program 1 times [2019-11-16 00:26:07,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:07,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992859699] [2019-11-16 00:26:07,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:07,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:07,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:07,613 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1666415, now seen corresponding path program 1 times [2019-11-16 00:26:07,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:07,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388985636] [2019-11-16 00:26:07,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:07,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:07,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:07,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:07,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1185130174, now seen corresponding path program 2 times [2019-11-16 00:26:07,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:07,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331018153] [2019-11-16 00:26:07,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:07,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:07,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:07,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331018153] [2019-11-16 00:26:07,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:07,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:26:07,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688693132] [2019-11-16 00:26:07,750 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:07,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:07,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:07,750 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:07,750 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:07,750 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:07,750 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:07,750 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:07,750 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration2_Loop [2019-11-16 00:26:07,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:07,750 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:07,752 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:26:07,754 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:26:07,756 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:26:07,761 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:26:07,763 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:26:07,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:07,771 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:26:07,774 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:26:07,855 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:07,855 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:07,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:07,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:07,874 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:07,874 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:07,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:07,890 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:07,894 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:07,894 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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) [2019-11-16 00:26:07,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:07,910 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:07,914 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:07,914 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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:26:07,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:07,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:07,933 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:07,933 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/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) [2019-11-16 00:26:07,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:07,940 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:07,947 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:07,947 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:07,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:07,958 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:07,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:07,974 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:07,984 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:26:07,985 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:07,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:07,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:07,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:07,986 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:26:07,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:07,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:07,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:07,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration2_Loop [2019-11-16 00:26:07,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:07,986 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:07,987 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:26:07,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:26:07,994 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:26:07,996 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:26:07,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:08,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:08,003 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:26:08,008 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:26:08,069 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:08,069 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:26:08,069 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:26:08,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:08,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:08,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:08,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:08,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:08,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:08,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:08,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:08,072 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:26:08,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:08,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:08,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:08,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:08,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:08,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:08,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:08,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:08,074 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:26:08,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:08,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:08,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:08,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:08,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:08,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:08,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:08,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:08,076 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:26:08,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:08,077 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:08,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:08,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:08,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:08,078 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:08,078 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:08,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:08,079 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:26:08,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:08,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:08,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:08,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:08,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:08,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:08,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:08,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:08,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:26:08,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:08,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:08,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:08,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:08,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:08,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:08,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:08,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:08,085 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:26:08,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:08,086 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:08,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:08,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:08,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:08,087 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:08,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:08,089 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:26:08,091 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:26:08,091 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:26:08,091 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:26:08,091 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:26:08,092 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:26:08,092 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = -2*ackermann_#in~n + 1 Supporting invariants [] [2019-11-16 00:26:08,092 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:26:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:08,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:26:08,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:08,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:08,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:08,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:26:08,196 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:26:08,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-16 00:26:08,285 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 61 states and 85 transitions. Complement of second has 13 states. [2019-11-16 00:26:08,287 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:26:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:26:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-16 00:26:08,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-16 00:26:08,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:08,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-16 00:26:08,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:08,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-16 00:26:08,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:08,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 85 transitions. [2019-11-16 00:26:08,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-16 00:26:08,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 53 states and 77 transitions. [2019-11-16 00:26:08,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-16 00:26:08,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-16 00:26:08,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 77 transitions. [2019-11-16 00:26:08,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:08,296 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 77 transitions. [2019-11-16 00:26:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 77 transitions. [2019-11-16 00:26:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-16 00:26:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-16 00:26:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-11-16 00:26:08,303 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-11-16 00:26:08,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:08,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:08,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:08,306 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 4 states. [2019-11-16 00:26:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:08,350 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2019-11-16 00:26:08,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:08,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2019-11-16 00:26:08,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-11-16 00:26:08,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 66 transitions. [2019-11-16 00:26:08,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-16 00:26:08,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-16 00:26:08,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 66 transitions. [2019-11-16 00:26:08,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:08,358 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 66 transitions. [2019-11-16 00:26:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 66 transitions. [2019-11-16 00:26:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-16 00:26:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-16 00:26:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2019-11-16 00:26:08,364 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2019-11-16 00:26:08,364 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2019-11-16 00:26:08,364 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:26:08,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2019-11-16 00:26:08,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-11-16 00:26:08,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:08,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:08,367 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:08,367 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-11-16 00:26:08,367 INFO L791 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 398#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 399#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 406#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 408#ackermannENTRY ~m := #in~m;~n := #in~n; 427#L15 assume !(0 == ~m); 429#L18 assume 0 == ~n; 413#L19 call #t~ret0 := ackermann(~m - 1, 1);< 414#ackermannENTRY [2019-11-16 00:26:08,368 INFO L793 eck$LassoCheckResult]: Loop: 414#ackermannENTRY ~m := #in~m;~n := #in~n; 416#L15 assume !(0 == ~m); 419#L18 assume !(0 == ~n); 402#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 404#ackermannENTRY ~m := #in~m;~n := #in~n; 434#L15 assume !(0 == ~m); 435#L18 assume 0 == ~n; 415#L19 call #t~ret0 := ackermann(~m - 1, 1);< 414#ackermannENTRY [2019-11-16 00:26:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1317091536, now seen corresponding path program 3 times [2019-11-16 00:26:08,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:08,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766825919] [2019-11-16 00:26:08,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:08,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:08,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:08,378 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1459432636, now seen corresponding path program 1 times [2019-11-16 00:26:08,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:08,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074674480] [2019-11-16 00:26:08,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:08,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:08,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:08,387 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1880893067, now seen corresponding path program 1 times [2019-11-16 00:26:08,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:08,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769464672] [2019-11-16 00:26:08,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:08,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:08,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:08,401 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:08,557 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:08,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:08,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:08,557 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:08,557 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:08,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:08,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:08,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:08,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration3_Loop [2019-11-16 00:26:08,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:08,558 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:08,559 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:26:08,563 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:26:08,567 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:26:08,569 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:26:08,571 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:26:08,572 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:26:08,574 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:26:08,576 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:26:08,644 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:08,644 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:08,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:08,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:08,651 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:08,651 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:08,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:08,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:08,658 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:08,658 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=1} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:08,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:08,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:08,664 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:08,664 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:08,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:08,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:08,671 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:08,671 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:08,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:08,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:08,680 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:08,680 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:08,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:08,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:08,688 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:08,688 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:08,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:08,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:08,699 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:08,699 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:08,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:08,710 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:08,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:08,729 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:08,746 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:08,746 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8} Honda state: {ackermann_#in~m=-8} Generalized eigenvectors: [{ackermann_#in~m=0}, {ackermann_#in~m=0}, {ackermann_#in~m=-1}] Lambdas: [5, 0, 1] Nus: [1, 0] [2019-11-16 00:26:08,863 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:08,863 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:08,863 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:08,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:08,863 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:08,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:08,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:08,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:08,864 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration3_Lasso [2019-11-16 00:26:08,864 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:08,864 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:08,865 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:26:08,871 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:26:08,873 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:26:08,879 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:26:08,880 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:26:08,883 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:26:08,884 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:26:08,886 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:26:08,887 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:26:08,889 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:26:08,890 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:26:08,892 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:26:08,894 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:26:08,896 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:26:08,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:08,919 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:26:09,007 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:09,007 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,016 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,027 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,027 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,034 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,035 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=0} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,041 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,042 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:09,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,046 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,049 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,050 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,056 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,057 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,064 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,064 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,073 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,073 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,080 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,080 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,088 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,088 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,097 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,097 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,104 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,104 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~result~0=0} Honda state: {ULTIMATE.start_main_~result~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,111 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,111 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0=0} Honda state: {ULTIMATE.start_main_~n~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,132 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:09,133 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:09,137 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:09,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:09,149 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:26:09,150 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:09,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:09,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:09,151 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:09,151 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:26:09,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:09,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:09,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration3_Lasso [2019-11-16 00:26:09,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:09,151 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:09,153 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:26:09,158 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:26:09,161 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:26:09,166 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:26:09,173 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:26:09,178 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:26:09,181 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:26:09,183 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:26:09,185 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:26:09,186 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:26:09,187 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:26:09,189 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:26:09,191 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:26:09,199 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:26:09,200 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:26:09,202 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:26:09,282 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:09,282 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:26:09,283 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:26:09,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,284 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,285 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:26:09,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,286 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,286 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,286 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,287 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:26:09,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,290 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:26:09,290 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:26:09,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,297 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:26:09,298 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,298 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,298 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,298 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,298 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,299 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,299 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,305 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:26:09,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,308 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:26:09,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,313 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,313 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,315 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:26:09,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,315 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,316 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,316 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,317 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:26:09,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,318 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,319 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,319 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,321 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:26:09,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,323 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,325 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:26:09,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,326 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,327 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,327 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,329 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:26:09,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,338 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:26:09,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,339 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:09,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:09,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,340 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:09,340 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:09,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:09,341 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:26:09,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:09,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:09,343 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:26:09,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:09,350 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:26:09,350 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:26:09,408 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:26:09,428 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:26:09,428 INFO L444 ModelExtractionUtils]: 3 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:26:09,429 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:26:09,431 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-11-16 00:26:09,431 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:26:09,431 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~m) = 1*ackermann_#in~m Supporting invariants [1*ackermann_#in~m >= 0] [2019-11-16 00:26:09,433 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-16 00:26:09,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:09,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:26:09,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:09,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:26:09,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:26:09,582 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2019-11-16 00:26:09,582 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 19 Second operand 9 states. [2019-11-16 00:26:09,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 19. Second operand 9 states. Result 139 states and 195 transitions. Complement of second has 32 states. [2019-11-16 00:26:09,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:26:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2019-11-16 00:26:09,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-16 00:26:09,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:09,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 16 letters. Loop has 8 letters. [2019-11-16 00:26:09,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:09,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 8 letters. Loop has 16 letters. [2019-11-16 00:26:09,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:09,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 195 transitions. [2019-11-16 00:26:09,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2019-11-16 00:26:09,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 85 states and 119 transitions. [2019-11-16 00:26:09,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-11-16 00:26:09,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2019-11-16 00:26:09,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 119 transitions. [2019-11-16 00:26:09,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:09,856 INFO L688 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2019-11-16 00:26:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 119 transitions. [2019-11-16 00:26:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-11-16 00:26:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-16 00:26:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2019-11-16 00:26:09,867 INFO L711 BuchiCegarLoop]: Abstraction has 69 states and 98 transitions. [2019-11-16 00:26:09,867 INFO L591 BuchiCegarLoop]: Abstraction has 69 states and 98 transitions. [2019-11-16 00:26:09,867 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:26:09,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 98 transitions. [2019-11-16 00:26:09,869 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2019-11-16 00:26:09,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:09,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:09,870 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:09,870 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:26:09,871 INFO L791 eck$LassoCheckResult]: Stem: 733#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 701#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 702#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 710#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 711#ackermannENTRY ~m := #in~m;~n := #in~n; 765#L15 assume !(0 == ~m); 768#L18 assume 0 == ~n; 706#L19 call #t~ret0 := ackermann(~m - 1, 1);< 714#ackermannENTRY ~m := #in~m;~n := #in~n; 746#L15 assume !(0 == ~m); 731#L18 [2019-11-16 00:26:09,871 INFO L793 eck$LassoCheckResult]: Loop: 731#L18 assume !(0 == ~n); 703#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 704#ackermannENTRY ~m := #in~m;~n := #in~n; 723#L15 assume !(0 == ~m); 731#L18 [2019-11-16 00:26:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1290385452, now seen corresponding path program 4 times [2019-11-16 00:26:09,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:09,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380916000] [2019-11-16 00:26:09,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:09,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:09,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:09,885 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:09,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:09,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1978510, now seen corresponding path program 2 times [2019-11-16 00:26:09,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:09,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273923175] [2019-11-16 00:26:09,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:09,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:09,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:09,892 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:09,893 INFO L82 PathProgramCache]: Analyzing trace with hash 743855841, now seen corresponding path program 2 times [2019-11-16 00:26:09,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:09,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105342180] [2019-11-16 00:26:09,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:09,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:09,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:09,906 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:09,992 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:09,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:09,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:09,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:09,992 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:09,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:09,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:09,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:09,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration4_Loop [2019-11-16 00:26:09,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:09,993 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:09,994 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:26:09,997 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:26:09,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:10,006 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:26:10,008 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:26:10,009 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:26:10,114 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:10,114 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,130 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,130 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:10,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,140 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,140 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,145 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:10,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,342 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-5, ackermann_#in~n=-7} Honda state: {ackermann_~n=-5, ackermann_#in~n=-7} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=-1}, {ackermann_~n=0, ackermann_#in~n=7}, {ackermann_~n=0, ackermann_#in~n=-5}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,351 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,351 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,361 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,361 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,368 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,374 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,374 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-7, ackermann_~m=-7} Honda state: {ackermann_#in~m=-7, ackermann_~m=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-11-16 00:26:10,622 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:10,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:10,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:10,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:10,623 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:10,623 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:10,623 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:10,623 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration4_Lasso [2019-11-16 00:26:10,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:10,623 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:10,624 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:26:10,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:10,630 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:26:10,631 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:26:10,633 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:26:10,635 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:26:10,636 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:26:10,638 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:26:10,652 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:26:10,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:10,663 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:26:10,664 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:26:10,666 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:26:10,668 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:26:10,796 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:10,796 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,806 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,806 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,814 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,814 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,822 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,822 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,830 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,830 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret6=0} Honda state: {ULTIMATE.start_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,838 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,838 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,847 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,847 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,856 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,856 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,867 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,867 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=0, ackermann_~m=0} Honda state: {ackermann_#in~m=2, ackermann_~m=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:10,876 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:10,876 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:10,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:10,894 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:10,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:10,910 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:11,084 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:26:11,086 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:11,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:11,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:11,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:11,086 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:26:11,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:11,087 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:11,087 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:11,087 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration4_Lasso [2019-11-16 00:26:11,087 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:11,087 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:11,088 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:26:11,090 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:26:11,092 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:26:11,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:26:11,097 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:26:11,099 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:26:11,101 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:26:11,127 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:26:11,129 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:26:11,131 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:26:11,142 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:26:11,144 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:26:11,153 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:26:11,160 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:26:11,333 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:11,333 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:26:11,333 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:26:11,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:11,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:11,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:11,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:11,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:11,336 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:26:11,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:11,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:11,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:11,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:11,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:11,338 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:26:11,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,338 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:11,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:11,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,339 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:11,339 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:11,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:11,340 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:26:11,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:11,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:11,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:11,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:11,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:11,346 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:26:11,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:11,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:11,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:11,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:11,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:11,350 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:26:11,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:11,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:11,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,351 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:11,352 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:11,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:11,353 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:26:11,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,354 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:26:11,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,357 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:26:11,357 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:26:11,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:11,380 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:26:11,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,381 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:11,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:11,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,382 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:11,382 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:11,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:11,383 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:26:11,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:11,384 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:11,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,384 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:11,384 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:11,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:11,385 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:26:11,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:11,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:11,386 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:26:11,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:11,390 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:26:11,390 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:26:11,455 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:26:11,514 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:26:11,516 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:26:11,516 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:26:11,520 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-11-16 00:26:11,521 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:26:11,521 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [1*ackermann_~n >= 0] [2019-11-16 00:26:11,524 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-16 00:26:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:11,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:26:11,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:11,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:26:11,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:11,700 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:26:11,700 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2019-11-16 00:26:11,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34 Second operand 7 states. [2019-11-16 00:26:11,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34. Second operand 7 states. Result 70 states and 99 transitions. Complement of second has 6 states. [2019-11-16 00:26:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:26:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-16 00:26:11,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-16 00:26:11,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:11,760 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:26:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:11,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:26:11,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:11,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:26:11,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:11,922 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:26:11,922 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2019-11-16 00:26:11,923 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34 Second operand 7 states. [2019-11-16 00:26:11,952 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34. Second operand 7 states. Result 70 states and 99 transitions. Complement of second has 6 states. [2019-11-16 00:26:11,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:26:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-16 00:26:11,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-16 00:26:11,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:11,954 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:26:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:12,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:26:12,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:12,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:26:12,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:12,079 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:26:12,080 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2019-11-16 00:26:12,080 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34 Second operand 7 states. [2019-11-16 00:26:12,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34. Second operand 7 states. Result 141 states and 191 transitions. Complement of second has 38 states. [2019-11-16 00:26:12,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2019-11-16 00:26:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:26:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2019-11-16 00:26:12,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-16 00:26:12,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:12,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-16 00:26:12,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:12,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-16 00:26:12,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:12,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 191 transitions. [2019-11-16 00:26:12,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2019-11-16 00:26:12,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 98 states and 142 transitions. [2019-11-16 00:26:12,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-11-16 00:26:12,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2019-11-16 00:26:12,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 142 transitions. [2019-11-16 00:26:12,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:12,232 INFO L688 BuchiCegarLoop]: Abstraction has 98 states and 142 transitions. [2019-11-16 00:26:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 142 transitions. [2019-11-16 00:26:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-16 00:26:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-16 00:26:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2019-11-16 00:26:12,245 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 138 transitions. [2019-11-16 00:26:12,246 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 138 transitions. [2019-11-16 00:26:12,246 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:26:12,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 138 transitions. [2019-11-16 00:26:12,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2019-11-16 00:26:12,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:12,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:12,250 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:12,250 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:26:12,250 INFO L791 eck$LassoCheckResult]: Stem: 1316#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 1278#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 1279#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 1285#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 1287#ackermannENTRY ~m := #in~m;~n := #in~n; 1296#L15 assume !(0 == ~m); 1373#L18 assume !(0 == ~n); 1284#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 1286#ackermannENTRY ~m := #in~m;~n := #in~n; 1299#L15 assume 0 == ~m;#res := 1 + ~n; 1319#ackermannFINAL assume true; 1320#ackermannEXIT >#44#return; 1281#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 1283#ackermannENTRY [2019-11-16 00:26:12,250 INFO L793 eck$LassoCheckResult]: Loop: 1283#ackermannENTRY ~m := #in~m;~n := #in~n; 1372#L15 assume !(0 == ~m); 1371#L18 assume !(0 == ~n); 1280#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 1283#ackermannENTRY [2019-11-16 00:26:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash 804076149, now seen corresponding path program 1 times [2019-11-16 00:26:12,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:12,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959255581] [2019-11-16 00:26:12,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:26:12,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959255581] [2019-11-16 00:26:12,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:12,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:26:12,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221965571] [2019-11-16 00:26:12,296 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:26:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:12,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1666510, now seen corresponding path program 3 times [2019-11-16 00:26:12,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:12,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142644664] [2019-11-16 00:26:12,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:12,301 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:12,348 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:12,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:12,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:12,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:12,349 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:12,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:12,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:12,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:12,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration5_Loop [2019-11-16 00:26:12,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:12,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:12,350 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:26:12,351 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:26:12,353 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:26:12,355 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:26:12,357 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:26:12,362 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:26:12,367 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:26:12,369 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:26:12,433 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:12,433 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:12,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:12,442 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:12,446 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:12,446 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:12,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:12,452 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:12,456 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:12,457 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:12,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:12,470 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:12,473 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:12,474 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:12,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:12,481 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:12,485 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:12,485 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:12,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:12,493 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:12,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:12,504 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:12,527 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:12,527 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-5} Honda state: {ackermann_#in~n=-5} Generalized eigenvectors: [{ackermann_#in~n=0}, {ackermann_#in~n=0}, {ackermann_#in~n=-1}] Lambdas: [1, 3, 1] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:12,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:12,537 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:12,544 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:12,544 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7} Honda state: {ackermann_#in~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:12,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:12,550 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:12,555 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:12,556 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:12,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:12,566 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:12,573 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:12,573 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-11-16 00:26:12,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:26:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:26:12,576 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. cyclomatic complexity: 46 Second operand 5 states. [2019-11-16 00:26:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:12,646 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2019-11-16 00:26:12,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:26:12,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 122 transitions. [2019-11-16 00:26:12,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-16 00:26:12,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 85 states and 116 transitions. [2019-11-16 00:26:12,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-16 00:26:12,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-11-16 00:26:12,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 116 transitions. [2019-11-16 00:26:12,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:12,658 INFO L688 BuchiCegarLoop]: Abstraction has 85 states and 116 transitions. [2019-11-16 00:26:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 116 transitions. [2019-11-16 00:26:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-11-16 00:26:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-16 00:26:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2019-11-16 00:26:12,672 INFO L711 BuchiCegarLoop]: Abstraction has 82 states and 112 transitions. [2019-11-16 00:26:12,672 INFO L591 BuchiCegarLoop]: Abstraction has 82 states and 112 transitions. [2019-11-16 00:26:12,672 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:26:12,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 112 transitions. [2019-11-16 00:26:12,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-16 00:26:12,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:12,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:12,678 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:12,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:12,679 INFO L791 eck$LassoCheckResult]: Stem: 1512#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 1481#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 1482#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 1489#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 1490#ackermannENTRY ~m := #in~m;~n := #in~n; 1506#L15 assume !(0 == ~m); 1509#L18 assume 0 == ~n; 1493#L19 call #t~ret0 := ackermann(~m - 1, 1);< 1494#ackermannENTRY ~m := #in~m;~n := #in~n; 1531#L15 assume !(0 == ~m); 1559#L18 assume !(0 == ~n); 1492#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 1507#ackermannENTRY ~m := #in~m;~n := #in~n; 1508#L15 assume !(0 == ~m); 1545#L18 assume 0 == ~n; 1495#L19 call #t~ret0 := ackermann(~m - 1, 1);< 1496#ackermannENTRY ~m := #in~m;~n := #in~n; 1529#L15 assume 0 == ~m;#res := 1 + ~n; 1527#ackermannFINAL assume true; 1521#ackermannEXIT >#42#return; 1523#L19-1 #res := #t~ret0;havoc #t~ret0; 1536#ackermannFINAL assume true; 1534#ackermannEXIT >#44#return; 1484#L21-1 [2019-11-16 00:26:12,679 INFO L793 eck$LassoCheckResult]: Loop: 1484#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 1533#ackermannENTRY ~m := #in~m;~n := #in~n; 1537#L15 assume !(0 == ~m); 1538#L18 assume 0 == ~n; 1525#L19 call #t~ret0 := ackermann(~m - 1, 1);< 1526#ackermannENTRY ~m := #in~m;~n := #in~n; 1553#L15 assume !(0 == ~m); 1552#L18 assume !(0 == ~n); 1487#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 1551#ackermannENTRY ~m := #in~m;~n := #in~n; 1548#L15 assume !(0 == ~m); 1546#L18 assume 0 == ~n; 1525#L19 call #t~ret0 := ackermann(~m - 1, 1);< 1526#ackermannENTRY ~m := #in~m;~n := #in~n; 1553#L15 assume 0 == ~m;#res := 1 + ~n; 1554#ackermannFINAL assume true; 1558#ackermannEXIT >#42#return; 1523#L19-1 #res := #t~ret0;havoc #t~ret0; 1536#ackermannFINAL assume true; 1534#ackermannEXIT >#44#return; 1484#L21-1 [2019-11-16 00:26:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1914958677, now seen corresponding path program 1 times [2019-11-16 00:26:12,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:12,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609839467] [2019-11-16 00:26:12,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:12,715 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash -190850389, now seen corresponding path program 1 times [2019-11-16 00:26:12,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:12,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866343214] [2019-11-16 00:26:12,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:12,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1249696767, now seen corresponding path program 1 times [2019-11-16 00:26:12,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:12,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891584905] [2019-11-16 00:26:12,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:12,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-16 00:26:13,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891584905] [2019-11-16 00:26:13,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547746040] [2019-11-16 00:26:13,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:13,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:26:13,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-16 00:26:13,320 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:13,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 22 [2019-11-16 00:26:13,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266605343] [2019-11-16 00:26:13,689 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:13,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:13,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:13,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:13,689 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:13,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:13,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:13,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:13,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration6_Loop [2019-11-16 00:26:13,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:13,690 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:13,691 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:26:13,692 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:26:13,698 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:26:13,700 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:26:13,705 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:26:13,710 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:26:13,764 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:13,764 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:13,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:13,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:13,771 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:13,771 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:13,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:13,775 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:13,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:13,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:15,270 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:26:15,272 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:15,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:15,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:15,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:15,272 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:26:15,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:15,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:15,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:15,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration6_Loop [2019-11-16 00:26:15,273 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:15,273 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:15,273 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:26:15,277 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:26:15,279 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:26:15,291 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:26:15,299 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:26:15,306 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:26:15,370 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:15,370 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:26:15,371 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:26:15,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:15,372 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:15,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:15,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:15,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:15,372 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:15,372 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:15,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:15,373 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:26:15,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:15,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:15,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:15,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:15,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:15,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:15,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:15,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:15,375 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:26:15,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:15,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:15,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:15,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:15,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:15,377 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:15,378 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:15,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:15,379 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:26:15,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:15,380 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:15,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:15,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:15,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:15,381 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:15,381 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:15,383 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:26:15,384 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:26:15,385 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:26:15,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:26:15,385 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:26:15,386 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:26:15,386 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [] [2019-11-16 00:26:15,386 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:26:15,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:15,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:26:15,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:15,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:15,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:26:15,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:26:15,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2019-11-16 00:26:15,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 112 transitions. cyclomatic complexity: 33 Second operand 11 states. [2019-11-16 00:26:15,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 112 transitions. cyclomatic complexity: 33. Second operand 11 states. Result 180 states and 253 transitions. Complement of second has 31 states. [2019-11-16 00:26:15,810 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:26:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:26:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2019-11-16 00:26:15,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 23 letters. Loop has 20 letters. [2019-11-16 00:26:15,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:15,811 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:26:15,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:15,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:26:15,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:15,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:26:15,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:26:16,011 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2019-11-16 00:26:16,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 112 transitions. cyclomatic complexity: 33 Second operand 11 states. [2019-11-16 00:26:16,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 112 transitions. cyclomatic complexity: 33. Second operand 11 states. Result 288 states and 426 transitions. Complement of second has 49 states. [2019-11-16 00:26:16,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:26:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2019-11-16 00:26:16,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 23 letters. Loop has 20 letters. [2019-11-16 00:26:16,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:16,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 43 letters. Loop has 20 letters. [2019-11-16 00:26:16,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:16,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 23 letters. Loop has 40 letters. [2019-11-16 00:26:16,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:16,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 426 transitions. [2019-11-16 00:26:16,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2019-11-16 00:26:16,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 227 states and 351 transitions. [2019-11-16 00:26:16,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2019-11-16 00:26:16,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2019-11-16 00:26:16,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 351 transitions. [2019-11-16 00:26:16,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:16,474 INFO L688 BuchiCegarLoop]: Abstraction has 227 states and 351 transitions. [2019-11-16 00:26:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 351 transitions. [2019-11-16 00:26:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2019-11-16 00:26:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-16 00:26:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 327 transitions. [2019-11-16 00:26:16,528 INFO L711 BuchiCegarLoop]: Abstraction has 212 states and 327 transitions. [2019-11-16 00:26:16,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:16,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:26:16,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:26:16,530 INFO L87 Difference]: Start difference. First operand 212 states and 327 transitions. Second operand 22 states. [2019-11-16 00:26:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:17,494 INFO L93 Difference]: Finished difference Result 247 states and 398 transitions. [2019-11-16 00:26:17,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:26:17,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 398 transitions. [2019-11-16 00:26:17,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 55 [2019-11-16 00:26:17,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 245 states and 396 transitions. [2019-11-16 00:26:17,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2019-11-16 00:26:17,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2019-11-16 00:26:17,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 396 transitions. [2019-11-16 00:26:17,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:17,517 INFO L688 BuchiCegarLoop]: Abstraction has 245 states and 396 transitions. [2019-11-16 00:26:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 396 transitions. [2019-11-16 00:26:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2019-11-16 00:26:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-16 00:26:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 360 transitions. [2019-11-16 00:26:17,550 INFO L711 BuchiCegarLoop]: Abstraction has 231 states and 360 transitions. [2019-11-16 00:26:17,550 INFO L591 BuchiCegarLoop]: Abstraction has 231 states and 360 transitions. [2019-11-16 00:26:17,550 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:26:17,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 360 transitions. [2019-11-16 00:26:17,553 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 55 [2019-11-16 00:26:17,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:17,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:17,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:17,555 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:26:17,555 INFO L791 eck$LassoCheckResult]: Stem: 3151#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 3091#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 3092#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 3105#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 3106#ackermannENTRY ~m := #in~m;~n := #in~n; 3195#L15 assume !(0 == ~m); 3211#L18 assume 0 == ~n; 3178#L19 call #t~ret0 := ackermann(~m - 1, 1);< 3187#ackermannENTRY ~m := #in~m;~n := #in~n; 3185#L15 assume !(0 == ~m); 3186#L18 assume !(0 == ~n); 3137#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3180#ackermannENTRY ~m := #in~m;~n := #in~n; 3172#L15 assume !(0 == ~m); 3174#L18 assume 0 == ~n; 3136#L19 call #t~ret0 := ackermann(~m - 1, 1);< 3138#ackermannENTRY ~m := #in~m;~n := #in~n; 3189#L15 assume 0 == ~m;#res := 1 + ~n; 3210#ackermannFINAL assume true; 3208#ackermannEXIT >#42#return; 3206#L19-1 #res := #t~ret0;havoc #t~ret0; 3204#ackermannFINAL assume true; 3202#ackermannEXIT >#44#return; 3142#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 3239#ackermannENTRY ~m := #in~m;~n := #in~n; 3241#L15 assume !(0 == ~m); 3141#L18 assume !(0 == ~n); 3135#L21 [2019-11-16 00:26:17,555 INFO L793 eck$LassoCheckResult]: Loop: 3135#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3297#ackermannENTRY ~m := #in~m;~n := #in~n; 3293#L15 assume !(0 == ~m); 3294#L18 assume !(0 == ~n); 3135#L21 [2019-11-16 00:26:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash 229970726, now seen corresponding path program 2 times [2019-11-16 00:26:17,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:17,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032248681] [2019-11-16 00:26:17,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:17,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:17,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:26:17,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032248681] [2019-11-16 00:26:17,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29046328] [2019-11-16 00:26:17,646 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:17,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:26:17,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:26:17,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:26:17,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:26:17,762 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:17,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-16 00:26:17,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956326631] [2019-11-16 00:26:17,763 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:26:17,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:17,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2228500, now seen corresponding path program 4 times [2019-11-16 00:26:17,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:17,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528124178] [2019-11-16 00:26:17,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:17,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:17,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:17,768 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:17,822 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:17,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:17,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:17,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:17,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:17,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:17,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:17,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:17,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration7_Loop [2019-11-16 00:26:17,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:17,823 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:17,824 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:26:17,826 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:26:17,828 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:26:17,829 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:26:17,831 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:26:17,837 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:26:17,931 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:17,931 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:17,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:17,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:17,942 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:17,942 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:17,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:17,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:17,949 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:17,950 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:17,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:17,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:17,957 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:17,957 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:17,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:17,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:17,966 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:17,966 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:17,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:17,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:17,976 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:17,976 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=4, ackermann_~m=4} Honda state: {ackermann_#in~m=4, ackermann_~m=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:17,981 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:17,981 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:17,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:17,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:20,131 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:20,131 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0, ackermann_#in~n=0} Honda state: {ackermann_~n=0, ackermann_#in~n=0} Generalized eigenvectors: [{ackermann_~n=0, ackermann_#in~n=0}, {ackermann_~n=-1, ackermann_#in~n=-1}, {ackermann_~n=0, ackermann_#in~n=0}] Lambdas: [11, 1, 4] Nus: [0, 1] [2019-11-16 00:26:20,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:20,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:26:20,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:20,134 INFO L87 Difference]: Start difference. First operand 231 states and 360 transitions. cyclomatic complexity: 135 Second operand 7 states. [2019-11-16 00:26:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:20,222 INFO L93 Difference]: Finished difference Result 149 states and 216 transitions. [2019-11-16 00:26:20,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:26:20,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 216 transitions. [2019-11-16 00:26:20,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-16 00:26:20,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 141 states and 199 transitions. [2019-11-16 00:26:20,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-11-16 00:26:20,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-11-16 00:26:20,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 199 transitions. [2019-11-16 00:26:20,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:20,231 INFO L688 BuchiCegarLoop]: Abstraction has 141 states and 199 transitions. [2019-11-16 00:26:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 199 transitions. [2019-11-16 00:26:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2019-11-16 00:26:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-16 00:26:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 188 transitions. [2019-11-16 00:26:20,239 INFO L711 BuchiCegarLoop]: Abstraction has 135 states and 188 transitions. [2019-11-16 00:26:20,239 INFO L591 BuchiCegarLoop]: Abstraction has 135 states and 188 transitions. [2019-11-16 00:26:20,239 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:26:20,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 188 transitions. [2019-11-16 00:26:20,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-16 00:26:20,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:20,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:20,247 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:20,247 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 7, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2] [2019-11-16 00:26:20,248 INFO L791 eck$LassoCheckResult]: Stem: 3614#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 3579#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 3580#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 3588#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 3589#ackermannENTRY ~m := #in~m;~n := #in~n; 3616#L15 assume !(0 == ~m); 3608#L18 assume !(0 == ~n); 3609#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3658#ackermannENTRY ~m := #in~m;~n := #in~n; 3656#L15 assume !(0 == ~m); 3655#L18 assume 0 == ~n; 3635#L19 call #t~ret0 := ackermann(~m - 1, 1);< 3594#ackermannENTRY ~m := #in~m;~n := #in~n; 3672#L15 assume !(0 == ~m); 3671#L18 assume !(0 == ~n); 3591#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3637#ackermannENTRY ~m := #in~m;~n := #in~n; 3629#L15 assume !(0 == ~m); 3631#L18 assume 0 == ~n; 3595#L19 call #t~ret0 := ackermann(~m - 1, 1);< 3596#ackermannENTRY ~m := #in~m;~n := #in~n; 3670#L15 assume 0 == ~m;#res := 1 + ~n; 3669#ackermannFINAL assume true; 3667#ackermannEXIT >#42#return; 3665#L19-1 #res := #t~ret0;havoc #t~ret0; 3664#ackermannFINAL assume true; 3663#ackermannEXIT >#44#return; 3661#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 3662#ackermannENTRY ~m := #in~m;~n := #in~n; 3668#L15 assume 0 == ~m;#res := 1 + ~n; 3666#ackermannFINAL assume true; 3660#ackermannEXIT >#46#return; 3659#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 3657#ackermannFINAL assume true; 3647#ackermannEXIT >#42#return; 3645#L19-1 #res := #t~ret0;havoc #t~ret0; 3643#ackermannFINAL assume true; 3638#ackermannEXIT >#44#return; 3618#L21-1 [2019-11-16 00:26:20,248 INFO L793 eck$LassoCheckResult]: Loop: 3618#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 3583#ackermannENTRY ~m := #in~m;~n := #in~n; 3632#L15 assume !(0 == ~m); 3623#L18 assume !(0 == ~n); 3619#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3583#ackermannENTRY ~m := #in~m;~n := #in~n; 3632#L15 assume !(0 == ~m); 3623#L18 assume 0 == ~n; 3586#L19 call #t~ret0 := ackermann(~m - 1, 1);< 3648#ackermannENTRY ~m := #in~m;~n := #in~n; 3676#L15 assume !(0 == ~m); 3675#L18 assume !(0 == ~n); 3584#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3587#ackermannENTRY ~m := #in~m;~n := #in~n; 3652#L15 assume !(0 == ~m); 3653#L18 assume !(0 == ~n); 3605#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3603#ackermannENTRY ~m := #in~m;~n := #in~n; 3606#L15 assume !(0 == ~m); 3674#L18 assume !(0 == ~n); 3604#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3603#ackermannENTRY ~m := #in~m;~n := #in~n; 3606#L15 assume !(0 == ~m); 3674#L18 assume !(0 == ~n); 3604#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3603#ackermannENTRY ~m := #in~m;~n := #in~n; 3606#L15 assume !(0 == ~m); 3673#L18 assume 0 == ~n; 3586#L19 call #t~ret0 := ackermann(~m - 1, 1);< 3648#ackermannENTRY ~m := #in~m;~n := #in~n; 3676#L15 assume 0 == ~m;#res := 1 + ~n; 3677#ackermannFINAL assume true; 3705#ackermannEXIT >#42#return; 3704#L19-1 #res := #t~ret0;havoc #t~ret0; 3679#ackermannFINAL assume true; 3680#ackermannEXIT >#44#return; 3699#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 3700#ackermannENTRY ~m := #in~m;~n := #in~n; 3713#L15 assume 0 == ~m;#res := 1 + ~n; 3712#ackermannFINAL assume true; 3697#ackermannEXIT >#46#return; 3696#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 3703#ackermannFINAL assume true; 3649#ackermannEXIT >#44#return; 3601#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 3599#ackermannENTRY ~m := #in~m;~n := #in~n; 3602#L15 assume 0 == ~m;#res := 1 + ~n; 3615#ackermannFINAL assume true; 3620#ackermannEXIT >#46#return; 3696#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 3703#ackermannFINAL assume true; 3649#ackermannEXIT >#44#return; 3600#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 3599#ackermannENTRY ~m := #in~m;~n := #in~n; 3602#L15 assume 0 == ~m;#res := 1 + ~n; 3615#ackermannFINAL assume true; 3620#ackermannEXIT >#46#return; 3695#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 3694#ackermannFINAL assume true; 3686#ackermannEXIT >#44#return; 3685#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 3688#ackermannENTRY ~m := #in~m;~n := #in~n; 3692#L15 assume 0 == ~m;#res := 1 + ~n; 3627#ackermannFINAL assume true; 3684#ackermannEXIT >#46#return; 3642#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 3681#ackermannFINAL assume true; 3650#ackermannEXIT >#42#return; 3645#L19-1 #res := #t~ret0;havoc #t~ret0; 3643#ackermannFINAL assume true; 3638#ackermannEXIT >#44#return; 3618#L21-1 [2019-11-16 00:26:20,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:20,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1109551826, now seen corresponding path program 1 times [2019-11-16 00:26:20,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:20,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581402286] [2019-11-16 00:26:20,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:20,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:20,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:20,262 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:20,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2128807366, now seen corresponding path program 1 times [2019-11-16 00:26:20,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:20,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774197026] [2019-11-16 00:26:20,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:20,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:20,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 103 proven. 65 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-16 00:26:20,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774197026] [2019-11-16 00:26:20,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150594964] [2019-11-16 00:26:20,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:26:20,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 112 proven. 45 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-11-16 00:26:20,682 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:20,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-11-16 00:26:20,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815006938] [2019-11-16 00:26:20,683 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:26:20,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:20,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:26:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:26:20,685 INFO L87 Difference]: Start difference. First operand 135 states and 188 transitions. cyclomatic complexity: 56 Second operand 12 states. [2019-11-16 00:26:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:20,979 INFO L93 Difference]: Finished difference Result 199 states and 421 transitions. [2019-11-16 00:26:20,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:26:20,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 421 transitions. [2019-11-16 00:26:20,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2019-11-16 00:26:20,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 170 states and 329 transitions. [2019-11-16 00:26:20,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2019-11-16 00:26:20,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2019-11-16 00:26:20,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 329 transitions. [2019-11-16 00:26:20,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:20,997 INFO L688 BuchiCegarLoop]: Abstraction has 170 states and 329 transitions. [2019-11-16 00:26:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 329 transitions. [2019-11-16 00:26:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2019-11-16 00:26:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-16 00:26:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 160 transitions. [2019-11-16 00:26:21,017 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 160 transitions. [2019-11-16 00:26:21,017 INFO L591 BuchiCegarLoop]: Abstraction has 118 states and 160 transitions. [2019-11-16 00:26:21,017 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:26:21,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 160 transitions. [2019-11-16 00:26:21,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-11-16 00:26:21,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:21,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:21,073 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:21,073 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [15, 12, 11, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3] [2019-11-16 00:26:21,074 INFO L791 eck$LassoCheckResult]: Stem: 4452#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 4416#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 4417#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 4425#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 4426#ackermannENTRY ~m := #in~m;~n := #in~n; 4476#L15 assume !(0 == ~m); 4477#L18 assume 0 == ~n; 4470#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4473#ackermannENTRY ~m := #in~m;~n := #in~n; 4469#L15 assume !(0 == ~m); 4472#L18 assume !(0 == ~n); 4462#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4467#ackermannENTRY ~m := #in~m;~n := #in~n; 4465#L15 assume !(0 == ~m); 4466#L18 assume !(0 == ~n); 4433#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4468#ackermannENTRY ~m := #in~m;~n := #in~n; 4520#L15 assume !(0 == ~m); 4519#L18 assume 0 == ~n; 4440#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4441#ackermannENTRY ~m := #in~m;~n := #in~n; 4469#L15 assume !(0 == ~m); 4472#L18 assume !(0 == ~n); 4462#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4467#ackermannENTRY ~m := #in~m;~n := #in~n; 4465#L15 assume !(0 == ~m); 4461#L18 assume 0 == ~n; 4463#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4441#ackermannENTRY ~m := #in~m;~n := #in~n; 4474#L15 assume 0 == ~m;#res := 1 + ~n; 4494#ackermannFINAL assume true; 4486#ackermannEXIT >#42#return; 4487#L19-1 #res := #t~ret0;havoc #t~ret0; 4516#ackermannFINAL assume true; 4509#ackermannEXIT >#44#return; 4507#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 4508#ackermannENTRY ~m := #in~m;~n := #in~n; 4518#L15 assume 0 == ~m;#res := 1 + ~n; 4517#ackermannFINAL assume true; 4506#ackermannEXIT >#46#return; 4504#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 4500#ackermannFINAL assume true; 4491#ackermannEXIT >#42#return; 4490#L19-1 #res := #t~ret0;havoc #t~ret0; 4531#ackermannFINAL assume true; 4529#ackermannEXIT >#44#return; 4429#L21-1 [2019-11-16 00:26:21,077 INFO L793 eck$LassoCheckResult]: Loop: 4429#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 4421#ackermannENTRY ~m := #in~m;~n := #in~n; 4464#L15 assume !(0 == ~m); 4460#L18 assume 0 == ~n; 4438#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4439#ackermannENTRY ~m := #in~m;~n := #in~n; 4482#L15 assume !(0 == ~m); 4447#L18 assume !(0 == ~n); 4423#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4502#ackermannENTRY ~m := #in~m;~n := #in~n; 4512#L15 assume !(0 == ~m); 4513#L18 assume !(0 == ~n); 4422#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4424#ackermannENTRY ~m := #in~m;~n := #in~n; 4446#L15 assume !(0 == ~m); 4456#L18 assume 0 == ~n; 4438#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4439#ackermannENTRY ~m := #in~m;~n := #in~n; 4482#L15 assume !(0 == ~m); 4447#L18 assume !(0 == ~n); 4423#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4502#ackermannENTRY ~m := #in~m;~n := #in~n; 4512#L15 assume !(0 == ~m); 4511#L18 assume 0 == ~n; 4448#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4439#ackermannENTRY ~m := #in~m;~n := #in~n; 4482#L15 assume !(0 == ~m); 4447#L18 assume !(0 == ~n); 4423#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4502#ackermannENTRY ~m := #in~m;~n := #in~n; 4512#L15 assume !(0 == ~m); 4511#L18 assume 0 == ~n; 4448#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4439#ackermannENTRY ~m := #in~m;~n := #in~n; 4482#L15 assume 0 == ~m;#res := 1 + ~n; 4483#ackermannFINAL assume true; 4484#ackermannEXIT >#42#return; 4485#L19-1 #res := #t~ret0;havoc #t~ret0; 4505#ackermannFINAL assume true; 4501#ackermannEXIT >#44#return; 4496#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 4498#ackermannENTRY ~m := #in~m;~n := #in~n; 4524#L15 assume 0 == ~m;#res := 1 + ~n; 4523#ackermannFINAL assume true; 4495#ackermannEXIT >#46#return; 4493#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 4492#ackermannFINAL assume true; 4488#ackermannEXIT >#42#return; 4489#L19-1 #res := #t~ret0;havoc #t~ret0; 4522#ackermannFINAL assume true; 4503#ackermannEXIT >#44#return; 4420#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 4499#ackermannENTRY ~m := #in~m;~n := #in~n; 4514#L15 assume !(0 == ~m); 4510#L18 assume 0 == ~n; 4448#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4439#ackermannENTRY ~m := #in~m;~n := #in~n; 4482#L15 assume !(0 == ~m); 4447#L18 assume !(0 == ~n); 4423#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4502#ackermannENTRY ~m := #in~m;~n := #in~n; 4512#L15 assume !(0 == ~m); 4511#L18 assume 0 == ~n; 4448#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4439#ackermannENTRY ~m := #in~m;~n := #in~n; 4482#L15 assume 0 == ~m;#res := 1 + ~n; 4483#ackermannFINAL assume true; 4484#ackermannEXIT >#42#return; 4485#L19-1 #res := #t~ret0;havoc #t~ret0; 4505#ackermannFINAL assume true; 4501#ackermannEXIT >#44#return; 4496#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 4498#ackermannENTRY ~m := #in~m;~n := #in~n; 4524#L15 assume 0 == ~m;#res := 1 + ~n; 4523#ackermannFINAL assume true; 4495#ackermannEXIT >#46#return; 4493#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 4492#ackermannFINAL assume true; 4488#ackermannEXIT >#42#return; 4489#L19-1 #res := #t~ret0;havoc #t~ret0; 4522#ackermannFINAL assume true; 4503#ackermannEXIT >#46#return; 4493#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 4492#ackermannFINAL assume true; 4488#ackermannEXIT >#42#return; 4490#L19-1 #res := #t~ret0;havoc #t~ret0; 4531#ackermannFINAL assume true; 4529#ackermannEXIT >#44#return; 4429#L21-1 [2019-11-16 00:26:21,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:21,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1566968233, now seen corresponding path program 2 times [2019-11-16 00:26:21,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:21,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714993711] [2019-11-16 00:26:21,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:21,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:21,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-16 00:26:21,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714993711] [2019-11-16 00:26:21,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584726297] [2019-11-16 00:26:21,182 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:21,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:26:21,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:26:21,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:21,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-16 00:26:21,365 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:21,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-16 00:26:21,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450676499] [2019-11-16 00:26:21,366 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:26:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash -857449282, now seen corresponding path program 2 times [2019-11-16 00:26:21,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:21,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557315279] [2019-11-16 00:26:21,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:21,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:21,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 39 proven. 92 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-16 00:26:21,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557315279] [2019-11-16 00:26:21,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773686269] [2019-11-16 00:26:21,547 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:21,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:26:21,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:26:21,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:21,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 39 proven. 92 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-16 00:26:21,733 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:21,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-16 00:26:21,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329329857] [2019-11-16 00:26:21,734 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:26:21,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:21,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:26:21,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:26:21,735 INFO L87 Difference]: Start difference. First operand 118 states and 160 transitions. cyclomatic complexity: 45 Second operand 10 states. [2019-11-16 00:26:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:21,911 INFO L93 Difference]: Finished difference Result 135 states and 196 transitions. [2019-11-16 00:26:21,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:26:21,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 196 transitions. [2019-11-16 00:26:21,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-16 00:26:21,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 135 states and 194 transitions. [2019-11-16 00:26:21,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2019-11-16 00:26:21,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2019-11-16 00:26:21,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 194 transitions. [2019-11-16 00:26:21,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:21,918 INFO L688 BuchiCegarLoop]: Abstraction has 135 states and 194 transitions. [2019-11-16 00:26:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 194 transitions. [2019-11-16 00:26:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 110. [2019-11-16 00:26:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-16 00:26:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 144 transitions. [2019-11-16 00:26:21,926 INFO L711 BuchiCegarLoop]: Abstraction has 110 states and 144 transitions. [2019-11-16 00:26:21,926 INFO L591 BuchiCegarLoop]: Abstraction has 110 states and 144 transitions. [2019-11-16 00:26:21,926 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:26:21,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 144 transitions. [2019-11-16 00:26:21,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-16 00:26:21,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:21,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:21,929 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:21,929 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3] [2019-11-16 00:26:21,929 INFO L791 eck$LassoCheckResult]: Stem: 5487#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 5455#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 5456#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 5463#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 5464#ackermannENTRY ~m := #in~m;~n := #in~n; 5489#L15 assume !(0 == ~m); 5491#L18 assume !(0 == ~n); 5490#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 5518#ackermannENTRY ~m := #in~m;~n := #in~n; 5519#L15 assume !(0 == ~m); 5534#L18 assume 0 == ~n; 5510#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5513#ackermannENTRY ~m := #in~m;~n := #in~n; 5508#L15 assume !(0 == ~m); 5511#L18 assume !(0 == ~n); 5497#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 5524#ackermannENTRY ~m := #in~m;~n := #in~n; 5536#L15 assume !(0 == ~m); 5496#L18 assume 0 == ~n; 5498#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5474#ackermannENTRY ~m := #in~m;~n := #in~n; 5512#L15 assume 0 == ~m;#res := 1 + ~n; 5557#ackermannFINAL assume true; 5556#ackermannEXIT >#42#return; 5555#L19-1 #res := #t~ret0;havoc #t~ret0; 5554#ackermannFINAL assume true; 5553#ackermannEXIT >#44#return; 5538#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 5539#ackermannENTRY ~m := #in~m;~n := #in~n; 5541#L15 assume 0 == ~m;#res := 1 + ~n; 5540#ackermannFINAL assume true; 5537#ackermannEXIT >#46#return; 5535#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 5533#ackermannFINAL assume true; 5532#ackermannEXIT >#42#return; 5531#L19-1 #res := #t~ret0;havoc #t~ret0; 5558#ackermannFINAL assume true; 5520#ackermannEXIT >#44#return; 5470#L21-1 [2019-11-16 00:26:21,930 INFO L793 eck$LassoCheckResult]: Loop: 5470#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 5459#ackermannENTRY ~m := #in~m;~n := #in~n; 5499#L15 assume !(0 == ~m); 5501#L18 assume !(0 == ~n); 5469#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 5459#ackermannENTRY ~m := #in~m;~n := #in~n; 5499#L15 assume !(0 == ~m); 5501#L18 assume 0 == ~n; 5467#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5471#ackermannENTRY ~m := #in~m;~n := #in~n; 5526#L15 assume !(0 == ~m); 5482#L18 assume !(0 == ~n); 5461#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 5525#ackermannENTRY ~m := #in~m;~n := #in~n; 5542#L15 assume !(0 == ~m); 5516#L18 assume 0 == ~n; 5483#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5471#ackermannENTRY ~m := #in~m;~n := #in~n; 5526#L15 assume !(0 == ~m); 5482#L18 assume !(0 == ~n); 5461#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 5525#ackermannENTRY ~m := #in~m;~n := #in~n; 5542#L15 assume !(0 == ~m); 5516#L18 assume 0 == ~n; 5483#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5471#ackermannENTRY ~m := #in~m;~n := #in~n; 5526#L15 assume 0 == ~m;#res := 1 + ~n; 5527#ackermannFINAL assume true; 5552#ackermannEXIT >#42#return; 5551#L19-1 #res := #t~ret0;havoc #t~ret0; 5550#ackermannFINAL assume true; 5548#ackermannEXIT >#44#return; 5545#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 5546#ackermannENTRY ~m := #in~m;~n := #in~n; 5549#L15 assume 0 == ~m;#res := 1 + ~n; 5547#ackermannFINAL assume true; 5544#ackermannEXIT >#46#return; 5523#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 5543#ackermannFINAL assume true; 5530#ackermannEXIT >#42#return; 5529#L19-1 #res := #t~ret0;havoc #t~ret0; 5528#ackermannFINAL assume true; 5522#ackermannEXIT >#44#return; 5458#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 5505#ackermannENTRY ~m := #in~m;~n := #in~n; 5506#L15 assume !(0 == ~m); 5495#L18 assume 0 == ~n; 5483#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5471#ackermannENTRY ~m := #in~m;~n := #in~n; 5526#L15 assume !(0 == ~m); 5482#L18 assume !(0 == ~n); 5461#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 5525#ackermannENTRY ~m := #in~m;~n := #in~n; 5542#L15 assume !(0 == ~m); 5516#L18 assume 0 == ~n; 5483#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5471#ackermannENTRY ~m := #in~m;~n := #in~n; 5526#L15 assume 0 == ~m;#res := 1 + ~n; 5527#ackermannFINAL assume true; 5552#ackermannEXIT >#42#return; 5551#L19-1 #res := #t~ret0;havoc #t~ret0; 5550#ackermannFINAL assume true; 5548#ackermannEXIT >#44#return; 5545#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 5546#ackermannENTRY ~m := #in~m;~n := #in~n; 5549#L15 assume 0 == ~m;#res := 1 + ~n; 5547#ackermannFINAL assume true; 5544#ackermannEXIT >#46#return; 5523#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 5543#ackermannFINAL assume true; 5530#ackermannEXIT >#42#return; 5529#L19-1 #res := #t~ret0;havoc #t~ret0; 5528#ackermannFINAL assume true; 5522#ackermannEXIT >#46#return; 5523#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 5543#ackermannFINAL assume true; 5530#ackermannEXIT >#42#return; 5531#L19-1 #res := #t~ret0;havoc #t~ret0; 5558#ackermannFINAL assume true; 5520#ackermannEXIT >#44#return; 5470#L21-1 [2019-11-16 00:26:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1109551826, now seen corresponding path program 3 times [2019-11-16 00:26:21,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:21,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961030327] [2019-11-16 00:26:21,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:21,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:21,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:21,956 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash -817628327, now seen corresponding path program 3 times [2019-11-16 00:26:21,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:21,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656763144] [2019-11-16 00:26:21,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:21,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:21,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 125 proven. 113 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:26:22,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656763144] [2019-11-16 00:26:22,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190528982] [2019-11-16 00:26:22,480 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:22,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-11-16 00:26:22,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:26:22,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:26:22,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 126 proven. 108 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-16 00:26:22,826 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:22,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 29 [2019-11-16 00:26:22,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197256188] [2019-11-16 00:26:22,827 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:26:22,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-16 00:26:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:26:22,828 INFO L87 Difference]: Start difference. First operand 110 states and 144 transitions. cyclomatic complexity: 37 Second operand 29 states. [2019-11-16 00:26:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:24,354 INFO L93 Difference]: Finished difference Result 165 states and 229 transitions. [2019-11-16 00:26:24,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:26:24,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 229 transitions. [2019-11-16 00:26:24,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2019-11-16 00:26:24,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 164 states and 226 transitions. [2019-11-16 00:26:24,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2019-11-16 00:26:24,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2019-11-16 00:26:24,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 226 transitions. [2019-11-16 00:26:24,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:24,361 INFO L688 BuchiCegarLoop]: Abstraction has 164 states and 226 transitions. [2019-11-16 00:26:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 226 transitions. [2019-11-16 00:26:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2019-11-16 00:26:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-16 00:26:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 205 transitions. [2019-11-16 00:26:24,368 INFO L711 BuchiCegarLoop]: Abstraction has 150 states and 205 transitions. [2019-11-16 00:26:24,368 INFO L591 BuchiCegarLoop]: Abstraction has 150 states and 205 transitions. [2019-11-16 00:26:24,368 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:26:24,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 205 transitions. [2019-11-16 00:26:24,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2019-11-16 00:26:24,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:24,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:24,371 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:24,371 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:26:24,371 INFO L791 eck$LassoCheckResult]: Stem: 6386#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 6344#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 6345#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 6354#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 6355#ackermannENTRY ~m := #in~m;~n := #in~n; 6417#L15 assume !(0 == ~m); 6416#L18 assume 0 == ~n; 6393#L19 call #t~ret0 := ackermann(~m - 1, 1);< 6415#ackermannENTRY ~m := #in~m;~n := #in~n; 6390#L15 assume !(0 == ~m); 6394#L18 assume !(0 == ~n); 6399#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6428#ackermannENTRY ~m := #in~m;~n := #in~n; 6454#L15 assume !(0 == ~m); 6398#L18 assume 0 == ~n; 6391#L19 call #t~ret0 := ackermann(~m - 1, 1);< 6370#ackermannENTRY ~m := #in~m;~n := #in~n; 6390#L15 assume !(0 == ~m); 6394#L18 assume !(0 == ~n); 6399#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6428#ackermannENTRY ~m := #in~m;~n := #in~n; 6454#L15 assume !(0 == ~m); 6398#L18 assume 0 == ~n; 6391#L19 call #t~ret0 := ackermann(~m - 1, 1);< 6370#ackermannENTRY ~m := #in~m;~n := #in~n; 6414#L15 assume 0 == ~m;#res := 1 + ~n; 6466#ackermannFINAL assume true; 6464#ackermannEXIT >#42#return; 6462#L19-1 #res := #t~ret0;havoc #t~ret0; 6461#ackermannFINAL assume true; 6449#ackermannEXIT >#44#return; 6446#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 6447#ackermannENTRY ~m := #in~m;~n := #in~n; 6465#L15 assume 0 == ~m;#res := 1 + ~n; 6463#ackermannFINAL assume true; 6445#ackermannEXIT >#46#return; 6443#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 6441#ackermannFINAL assume true; 6433#ackermannEXIT >#42#return; 6431#L19-1 #res := #t~ret0;havoc #t~ret0; 6429#ackermannFINAL assume true; 6427#ackermannEXIT >#44#return; 6382#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 6426#ackermannENTRY ~m := #in~m;~n := #in~n; 6425#L15 assume !(0 == ~m); 6381#L18 assume !(0 == ~n); 6360#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6423#ackermannENTRY [2019-11-16 00:26:24,371 INFO L793 eck$LassoCheckResult]: Loop: 6423#ackermannENTRY ~m := #in~m;~n := #in~n; 6424#L15 assume !(0 == ~m); 6491#L18 assume !(0 == ~n); 6361#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6423#ackermannENTRY [2019-11-16 00:26:24,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:24,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2042677982, now seen corresponding path program 4 times [2019-11-16 00:26:24,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:24,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722206612] [2019-11-16 00:26:24,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:24,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:24,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:24,388 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:24,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:24,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1666510, now seen corresponding path program 5 times [2019-11-16 00:26:24,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:24,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132118373] [2019-11-16 00:26:24,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:24,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:24,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:24,394 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:24,394 INFO L82 PathProgramCache]: Analyzing trace with hash -997227989, now seen corresponding path program 5 times [2019-11-16 00:26:24,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:24,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233620684] [2019-11-16 00:26:24,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:24,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:24,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:24,411 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:24,464 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:24,465 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:24,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:24,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:24,465 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:24,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:24,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:24,465 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:24,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration11_Loop [2019-11-16 00:26:24,465 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:24,465 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:24,466 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:26:24,468 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:26:24,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:26:24,483 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:26:24,485 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:26:24,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:24,490 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:26:24,492 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:26:24,558 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:24,558 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:24,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:24,562 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:24,566 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:24,566 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:24,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:24,574 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:24,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:24,582 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:24,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:24,603 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-5} Honda state: {ackermann_#in~n=-5} Generalized eigenvectors: [{ackermann_#in~n=0}, {ackermann_#in~n=0}, {ackermann_#in~n=-1}] Lambdas: [1, 3, 1] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:24,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:24,608 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:24,612 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:24,612 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:24,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:24,618 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:24,622 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:24,623 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:24,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:24,629 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:24,633 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:24,633 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:24,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:24,639 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:24,643 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:24,643 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:24,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:24,649 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:24,653 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:24,654 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:24,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:24,663 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:24,668 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:24,668 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-5} Honda state: {ackermann_#in~m=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-11-16 00:26:24,961 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-11-16 00:26:25,366 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:25,366 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:25,366 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:25,366 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:25,367 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:25,367 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,367 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:25,367 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:25,367 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration11_Lasso [2019-11-16 00:26:25,367 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:25,367 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:25,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:26:25,370 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:26:25,372 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:26:25,374 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:26:25,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:26:25,379 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:26:25,385 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:26:25,387 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:26:25,389 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:26:25,391 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:26:25,393 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:26:25,394 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:26:25,397 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:26:25,398 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:26:25,407 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:26:25,409 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:26:25,487 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:25,488 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,491 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,491 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,493 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,493 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,500 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,500 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,505 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,507 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,508 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,512 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,512 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,515 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,515 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,523 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,523 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,531 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,531 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=0} Honda state: {ackermann_#in~m=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,541 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,541 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,552 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,552 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret6=0} Honda state: {ULTIMATE.start_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,557 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,559 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,559 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~result~0=0} Honda state: {ULTIMATE.start_main_~result~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:25,567 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,567 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:25,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,573 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,589 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,589 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0=0} Honda state: {ULTIMATE.start_main_~n~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:25,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,598 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,602 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:25,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,608 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,613 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:25,614 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:25,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:25,622 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:25,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:25,632 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,639 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:26:25,641 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:25,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:25,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:25,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:25,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:26:25,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:25,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:25,642 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:25,642 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration11_Lasso [2019-11-16 00:26:25,642 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:25,642 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:25,643 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:26:25,645 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:26:25,647 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:26:25,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:25,655 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:26:25,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:25,658 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:26:25,660 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:26:25,661 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:26:25,663 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:26:25,664 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:26:25,666 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:26:25,674 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:26:25,676 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:26:25,679 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:26:25,690 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:26:25,773 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:25,773 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:26:25,773 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:26:25,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,774 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,776 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:26:25,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,777 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,778 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:26:25,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,780 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,780 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,780 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:26:25,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,781 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:26:25,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,783 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:26:25,783 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:26:25,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,791 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:26:25,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,791 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,792 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,792 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,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:26:25,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,794 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,795 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,795 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:26:25,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,798 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:26:25,798 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,798 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,799 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,799 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,800 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:26:25,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,802 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:26:25,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,804 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,804 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,805 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:26:25,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,805 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,806 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,807 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:26:25,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,808 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,810 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:26:25,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,812 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:26:25,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,813 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:25,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:25,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,813 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:25,814 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:25,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:25,814 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:26:25,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:25,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:25,815 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:26:25,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:25,817 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:26:25,818 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:26:25,854 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:26:25,886 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:26:25,886 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:26:25,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:26:25,888 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-11-16 00:26:25,900 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:26:25,900 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = 1*ackermann_#in~n Supporting invariants [1*ackermann_#in~n >= 0] [2019-11-16 00:26:25,909 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-16 00:26:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:26,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-16 00:26:26,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:26,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:26,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:26:26,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:26,415 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:26:26,415 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 3 loop predicates [2019-11-16 00:26:26,415 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 150 states and 205 transitions. cyclomatic complexity: 59 Second operand 16 states. [2019-11-16 00:26:26,517 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 150 states and 205 transitions. cyclomatic complexity: 59. Second operand 16 states. Result 159 states and 221 transitions. Complement of second has 7 states. [2019-11-16 00:26:26,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:26:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-16 00:26:26,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 47 letters. Loop has 4 letters. [2019-11-16 00:26:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:26,522 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:26:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:26,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-16 00:26:26,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:26,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:26,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:26:26,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:27,005 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:26:27,005 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 3 loop predicates [2019-11-16 00:26:27,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 150 states and 205 transitions. cyclomatic complexity: 59 Second operand 16 states. [2019-11-16 00:26:27,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 150 states and 205 transitions. cyclomatic complexity: 59. Second operand 16 states. Result 159 states and 221 transitions. Complement of second has 7 states. [2019-11-16 00:26:27,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:26:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-16 00:26:27,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 47 letters. Loop has 4 letters. [2019-11-16 00:26:27,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:27,134 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:26:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:27,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-16 00:26:27,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:27,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:27,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:27,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:27,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:27,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:26:27,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:27,576 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:26:27,576 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 3 loop predicates [2019-11-16 00:26:27,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 150 states and 205 transitions. cyclomatic complexity: 59 Second operand 16 states. [2019-11-16 00:26:28,818 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 150 states and 205 transitions. cyclomatic complexity: 59. Second operand 16 states. Result 463 states and 694 transitions. Complement of second has 64 states. [2019-11-16 00:26:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 20 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-16 00:26:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:26:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-11-16 00:26:28,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 70 transitions. Stem has 47 letters. Loop has 4 letters. [2019-11-16 00:26:28,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:28,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 70 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-16 00:26:28,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:28,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 70 transitions. Stem has 47 letters. Loop has 8 letters. [2019-11-16 00:26:28,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:28,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 463 states and 694 transitions. [2019-11-16 00:26:28,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2019-11-16 00:26:28,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 463 states to 259 states and 337 transitions. [2019-11-16 00:26:28,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2019-11-16 00:26:28,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2019-11-16 00:26:28,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 259 states and 337 transitions. [2019-11-16 00:26:28,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:28,847 INFO L688 BuchiCegarLoop]: Abstraction has 259 states and 337 transitions. [2019-11-16 00:26:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states and 337 transitions. [2019-11-16 00:26:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 240. [2019-11-16 00:26:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-16 00:26:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 311 transitions. [2019-11-16 00:26:28,860 INFO L711 BuchiCegarLoop]: Abstraction has 240 states and 311 transitions. [2019-11-16 00:26:28,860 INFO L591 BuchiCegarLoop]: Abstraction has 240 states and 311 transitions. [2019-11-16 00:26:28,860 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:26:28,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 240 states and 311 transitions. [2019-11-16 00:26:28,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2019-11-16 00:26:28,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:28,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:28,865 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [15, 13, 10, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-11-16 00:26:28,865 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [16, 13, 11, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4] [2019-11-16 00:26:28,866 INFO L791 eck$LassoCheckResult]: Stem: 7965#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 7933#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 7934#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 7943#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 7944#ackermannENTRY ~m := #in~m;~n := #in~n; 7993#L15 assume !(0 == ~m); 7996#L18 assume !(0 == ~n); 7989#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7994#ackermannENTRY ~m := #in~m;~n := #in~n; 7995#L15 assume !(0 == ~m); 8053#L18 assume !(0 == ~n); 7990#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7994#ackermannENTRY ~m := #in~m;~n := #in~n; 7991#L15 assume !(0 == ~m); 7988#L18 assume 0 == ~n; 7984#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7987#ackermannENTRY ~m := #in~m;~n := #in~n; 7985#L15 assume !(0 == ~m); 7982#L18 assume !(0 == ~n); 7974#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7979#ackermannENTRY ~m := #in~m;~n := #in~n; 7980#L15 assume !(0 == ~m); 7973#L18 assume 0 == ~n; 7975#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7957#ackermannENTRY ~m := #in~m;~n := #in~n; 7985#L15 assume !(0 == ~m); 7982#L18 assume !(0 == ~n); 7974#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7979#ackermannENTRY ~m := #in~m;~n := #in~n; 7980#L15 assume !(0 == ~m); 7973#L18 assume 0 == ~n; 7975#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7957#ackermannENTRY ~m := #in~m;~n := #in~n; 7986#L15 assume 0 == ~m;#res := 1 + ~n; 8119#ackermannFINAL assume true; 8118#ackermannEXIT >#42#return; 8117#L19-1 #res := #t~ret0;havoc #t~ret0; 8116#ackermannFINAL assume true; 8114#ackermannEXIT >#44#return; 8111#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8112#ackermannENTRY ~m := #in~m;~n := #in~n; 8115#L15 assume 0 == ~m;#res := 1 + ~n; 8113#ackermannFINAL assume true; 8110#ackermannEXIT >#46#return; 8108#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 8107#ackermannFINAL assume true; 8074#ackermannEXIT >#42#return; 8072#L19-1 #res := #t~ret0;havoc #t~ret0; 8070#ackermannFINAL assume true; 8068#ackermannEXIT >#44#return; 8064#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8066#ackermannENTRY ~m := #in~m;~n := #in~n; 8099#L15 assume !(0 == ~m); 8094#L18 assume !(0 == ~n); 8009#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7939#ackermannENTRY ~m := #in~m;~n := #in~n; 8015#L15 assume !(0 == ~m); 8022#L18 assume !(0 == ~n); 7949#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8017#ackermannENTRY ~m := #in~m;~n := #in~n; 8013#L15 assume !(0 == ~m); 8014#L18 assume 0 == ~n; 7953#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7954#ackermannENTRY ~m := #in~m;~n := #in~n; 8109#L15 assume 0 == ~m;#res := 1 + ~n; 8003#ackermannFINAL assume true; 8105#ackermannEXIT >#42#return; 7962#L19-1 #res := #t~ret0;havoc #t~ret0; 7952#ackermannFINAL assume true; 7972#ackermannEXIT >#44#return; 7958#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 7950#ackermannENTRY ~m := #in~m;~n := #in~n; 7959#L15 assume 0 == ~m;#res := 1 + ~n; 7966#ackermannFINAL assume true; 8172#ackermannEXIT >#46#return; 8098#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 8093#ackermannFINAL assume true; 8091#ackermannEXIT >#44#return; 8079#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8089#ackermannENTRY ~m := #in~m;~n := #in~n; 8124#L15 assume 0 == ~m;#res := 1 + ~n; 8120#ackermannFINAL assume true; 8078#ackermannEXIT >#46#return; 8073#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 8071#ackermannFINAL assume true; 8063#ackermannEXIT >#46#return; 8061#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 8060#ackermannFINAL assume true; 8049#ackermannEXIT >#42#return; 8046#L19-1 #res := #t~ret0;havoc #t~ret0; 8044#ackermannFINAL assume true; 8038#ackermannEXIT >#44#return; 8040#L21-1 [2019-11-16 00:26:28,867 INFO L793 eck$LassoCheckResult]: Loop: 8040#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8028#ackermannENTRY ~m := #in~m;~n := #in~n; 8166#L15 assume !(0 == ~m); 8165#L18 assume !(0 == ~n); 7970#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8005#ackermannENTRY ~m := #in~m;~n := #in~n; 7967#L15 assume !(0 == ~m); 7971#L18 assume !(0 == ~n); 7947#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8031#ackermannENTRY ~m := #in~m;~n := #in~n; 8032#L15 assume !(0 == ~m); 8055#L18 assume !(0 == ~n); 7948#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8031#ackermannENTRY ~m := #in~m;~n := #in~n; 8033#L15 assume !(0 == ~m); 8054#L18 assume 0 == ~n; 8000#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8004#ackermannENTRY ~m := #in~m;~n := #in~n; 8002#L15 assume !(0 == ~m); 7997#L18 assume !(0 == ~n); 7941#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7960#ackermannENTRY ~m := #in~m;~n := #in~n; 7961#L15 assume !(0 == ~m); 8030#L18 assume 0 == ~n; 7998#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8004#ackermannENTRY ~m := #in~m;~n := #in~n; 8002#L15 assume !(0 == ~m); 7997#L18 assume !(0 == ~n); 7941#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7960#ackermannENTRY ~m := #in~m;~n := #in~n; 7961#L15 assume !(0 == ~m); 8030#L18 assume 0 == ~n; 7998#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8004#ackermannENTRY ~m := #in~m;~n := #in~n; 8002#L15 assume 0 == ~m;#res := 1 + ~n; 8003#ackermannFINAL assume true; 8105#ackermannEXIT >#42#return; 8104#L19-1 #res := #t~ret0;havoc #t~ret0; 8103#ackermannFINAL assume true; 8101#ackermannEXIT >#44#return; 8096#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8097#ackermannENTRY ~m := #in~m;~n := #in~n; 8102#L15 assume 0 == ~m;#res := 1 + ~n; 8100#ackermannFINAL assume true; 8095#ackermannEXIT >#46#return; 8092#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 8090#ackermannFINAL assume true; 8075#ackermannEXIT >#42#return; 8072#L19-1 #res := #t~ret0;havoc #t~ret0; 8070#ackermannFINAL assume true; 8068#ackermannEXIT >#44#return; 8064#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8066#ackermannENTRY ~m := #in~m;~n := #in~n; 8099#L15 assume !(0 == ~m); 8094#L18 assume !(0 == ~n); 8009#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7939#ackermannENTRY ~m := #in~m;~n := #in~n; 8015#L15 assume !(0 == ~m); 8022#L18 assume !(0 == ~n); 7949#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8017#ackermannENTRY ~m := #in~m;~n := #in~n; 8013#L15 assume !(0 == ~m); 8014#L18 assume 0 == ~n; 7953#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7954#ackermannENTRY ~m := #in~m;~n := #in~n; 8109#L15 assume 0 == ~m;#res := 1 + ~n; 8003#ackermannFINAL assume true; 8105#ackermannEXIT >#42#return; 7962#L19-1 #res := #t~ret0;havoc #t~ret0; 7952#ackermannFINAL assume true; 7972#ackermannEXIT >#44#return; 7958#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 7950#ackermannENTRY ~m := #in~m;~n := #in~n; 7959#L15 assume 0 == ~m;#res := 1 + ~n; 7966#ackermannFINAL assume true; 8172#ackermannEXIT >#46#return; 8098#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 8093#ackermannFINAL assume true; 8091#ackermannEXIT >#44#return; 8079#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8089#ackermannENTRY ~m := #in~m;~n := #in~n; 8124#L15 assume 0 == ~m;#res := 1 + ~n; 8120#ackermannFINAL assume true; 8078#ackermannEXIT >#46#return; 8073#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 8071#ackermannFINAL assume true; 8063#ackermannEXIT >#46#return; 8061#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 8060#ackermannFINAL assume true; 8049#ackermannEXIT >#42#return; 8046#L19-1 #res := #t~ret0;havoc #t~ret0; 8044#ackermannFINAL assume true; 8038#ackermannEXIT >#44#return; 8040#L21-1 [2019-11-16 00:26:28,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash 915423143, now seen corresponding path program 6 times [2019-11-16 00:26:28,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:28,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290677562] [2019-11-16 00:26:28,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:28,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:28,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 149 proven. 101 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-16 00:26:29,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290677562] [2019-11-16 00:26:29,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995291900] [2019-11-16 00:26:29,201 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:29,345 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-11-16 00:26:29,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:26:29,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:26:29,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 135 proven. 109 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-16 00:26:29,390 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:29,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2019-11-16 00:26:29,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590697883] [2019-11-16 00:26:29,391 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:26:29,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:29,392 INFO L82 PathProgramCache]: Analyzing trace with hash 514178910, now seen corresponding path program 4 times [2019-11-16 00:26:29,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:29,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609079323] [2019-11-16 00:26:29,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:29,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:29,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 163 proven. 101 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-11-16 00:26:29,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609079323] [2019-11-16 00:26:29,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368222582] [2019-11-16 00:26:29,657 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:29,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:26:29,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:26:29,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:26:29,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 149 proven. 109 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-16 00:26:29,878 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:29,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2019-11-16 00:26:29,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824895395] [2019-11-16 00:26:29,881 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:26:29,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:29,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:26:29,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:26:29,882 INFO L87 Difference]: Start difference. First operand 240 states and 311 transitions. cyclomatic complexity: 75 Second operand 18 states. [2019-11-16 00:26:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:30,684 INFO L93 Difference]: Finished difference Result 349 states and 486 transitions. [2019-11-16 00:26:30,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-16 00:26:30,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 486 transitions. [2019-11-16 00:26:30,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2019-11-16 00:26:30,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 265 states and 362 transitions. [2019-11-16 00:26:30,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-11-16 00:26:30,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2019-11-16 00:26:30,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 362 transitions. [2019-11-16 00:26:30,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:30,695 INFO L688 BuchiCegarLoop]: Abstraction has 265 states and 362 transitions. [2019-11-16 00:26:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 362 transitions. [2019-11-16 00:26:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 221. [2019-11-16 00:26:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-16 00:26:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 281 transitions. [2019-11-16 00:26:30,704 INFO L711 BuchiCegarLoop]: Abstraction has 221 states and 281 transitions. [2019-11-16 00:26:30,705 INFO L591 BuchiCegarLoop]: Abstraction has 221 states and 281 transitions. [2019-11-16 00:26:30,705 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-16 00:26:30,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 281 transitions. [2019-11-16 00:26:30,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2019-11-16 00:26:30,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:30,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:30,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 11, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2019-11-16 00:26:30,710 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [61, 58, 37, 26, 26, 24, 24, 24, 23, 23, 11, 11, 11, 11] [2019-11-16 00:26:30,711 INFO L791 eck$LassoCheckResult]: Stem: 9824#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 9783#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 9784#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 9792#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 9793#ackermannENTRY ~m := #in~m;~n := #in~n; 9852#L15 assume !(0 == ~m); 9854#L18 assume !(0 == ~n); 9802#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9849#ackermannENTRY ~m := #in~m;~n := #in~n; 9851#L15 assume !(0 == ~m); 9853#L18 assume !(0 == ~n); 9801#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9849#ackermannENTRY ~m := #in~m;~n := #in~n; 9850#L15 assume !(0 == ~m); 9846#L18 assume 0 == ~n; 9841#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9844#ackermannENTRY ~m := #in~m;~n := #in~n; 9843#L15 assume !(0 == ~m); 9840#L18 assume !(0 == ~n); 9832#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9837#ackermannENTRY ~m := #in~m;~n := #in~n; 9838#L15 assume !(0 == ~m); 9831#L18 assume 0 == ~n; 9833#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9808#ackermannENTRY ~m := #in~m;~n := #in~n; 9843#L15 assume !(0 == ~m); 9840#L18 assume !(0 == ~n); 9832#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9837#ackermannENTRY ~m := #in~m;~n := #in~n; 9838#L15 assume !(0 == ~m); 9831#L18 assume 0 == ~n; 9833#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9808#ackermannENTRY ~m := #in~m;~n := #in~n; 9845#L15 assume 0 == ~m;#res := 1 + ~n; 9974#ackermannFINAL assume true; 9890#ackermannEXIT >#42#return; 9891#L19-1 #res := #t~ret0;havoc #t~ret0; 9966#ackermannFINAL assume true; 9964#ackermannEXIT >#44#return; 9961#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9962#ackermannENTRY ~m := #in~m;~n := #in~n; 9965#L15 assume 0 == ~m;#res := 1 + ~n; 9963#ackermannFINAL assume true; 9960#ackermannEXIT >#46#return; 9959#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9958#ackermannFINAL assume true; 9957#ackermannEXIT >#42#return; 9896#L19-1 #res := #t~ret0;havoc #t~ret0; 9956#ackermannFINAL assume true; 9955#ackermannEXIT >#44#return; 9904#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9906#ackermannENTRY ~m := #in~m;~n := #in~n; 9954#L15 assume !(0 == ~m); 9952#L18 assume !(0 == ~n); 9816#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9788#ackermannENTRY ~m := #in~m;~n := #in~n; 9881#L15 assume !(0 == ~m); 9815#L18 assume !(0 == ~n); 9798#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9826#L15 assume !(0 == ~m); 9827#L18 assume !(0 == ~n); 9795#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9870#L15 assume !(0 == ~m); 9869#L18 assume 0 == ~n; 9804#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9805#ackermannENTRY ~m := #in~m;~n := #in~n; 9899#L15 assume 0 == ~m;#res := 1 + ~n; 9867#ackermannFINAL assume true; 9887#ackermannEXIT >#42#return; 9888#L19-1 #res := #t~ret0;havoc #t~ret0; 10000#ackermannFINAL assume true; 9999#ackermannEXIT >#44#return; 9794#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9990#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 10001#ackermannFINAL assume true; 9991#ackermannEXIT >#44#return; 9809#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9986#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9979#ackermannFINAL assume true; 9945#ackermannEXIT >#44#return; 9923#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9941#ackermannENTRY ~m := #in~m;~n := #in~n; 9970#L15 assume 0 == ~m;#res := 1 + ~n; 9969#ackermannFINAL assume true; 9921#ackermannEXIT >#46#return; 9928#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9950#ackermannFINAL assume true; 9903#ackermannEXIT >#46#return; 9900#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9898#ackermannFINAL assume true; 9892#ackermannEXIT >#42#return; 9893#L19-1 #res := #t~ret0;havoc #t~ret0; 9997#ackermannFINAL assume true; 9996#ackermannEXIT >#44#return; 9873#L21-1 [2019-11-16 00:26:30,711 INFO L793 eck$LassoCheckResult]: Loop: 9873#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9882#ackermannENTRY ~m := #in~m;~n := #in~n; 9880#L15 assume !(0 == ~m); 9879#L18 assume !(0 == ~n); 9822#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9871#ackermannENTRY ~m := #in~m;~n := #in~n; 9872#L15 assume !(0 == ~m); 9878#L18 assume !(0 == ~n); 9796#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9811#ackermannENTRY ~m := #in~m;~n := #in~n; 9812#L15 assume !(0 == ~m); 9877#L18 assume !(0 == ~n); 9797#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9811#ackermannENTRY ~m := #in~m;~n := #in~n; 9812#L15 assume !(0 == ~m); 9877#L18 assume !(0 == ~n); 9797#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9811#ackermannENTRY ~m := #in~m;~n := #in~n; 9813#L15 assume !(0 == ~m); 9949#L18 assume 0 == ~n; 9865#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9868#ackermannENTRY ~m := #in~m;~n := #in~n; 9866#L15 assume !(0 == ~m); 9862#L18 assume !(0 == ~n); 9790#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9913#ackermannENTRY ~m := #in~m;~n := #in~n; 9919#L15 assume !(0 == ~m); 9917#L18 assume 0 == ~n; 9864#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9868#ackermannENTRY ~m := #in~m;~n := #in~n; 9866#L15 assume !(0 == ~m); 9862#L18 assume !(0 == ~n); 9790#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9913#ackermannENTRY ~m := #in~m;~n := #in~n; 9919#L15 assume !(0 == ~m); 9917#L18 assume 0 == ~n; 9864#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9868#ackermannENTRY ~m := #in~m;~n := #in~n; 9866#L15 assume 0 == ~m;#res := 1 + ~n; 9867#ackermannFINAL assume true; 9887#ackermannEXIT >#42#return; 9889#L19-1 #res := #t~ret0;havoc #t~ret0; 9914#ackermannFINAL assume true; 9912#ackermannEXIT >#44#return; 9910#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9911#ackermannENTRY ~m := #in~m;~n := #in~n; 9916#L15 assume 0 == ~m;#res := 1 + ~n; 9915#ackermannFINAL assume true; 9909#ackermannEXIT >#46#return; 9908#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9907#ackermannFINAL assume true; 9895#ackermannEXIT >#42#return; 9896#L19-1 #res := #t~ret0;havoc #t~ret0; 9956#ackermannFINAL assume true; 9955#ackermannEXIT >#44#return; 9904#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9906#ackermannENTRY ~m := #in~m;~n := #in~n; 9954#L15 assume !(0 == ~m); 9952#L18 assume !(0 == ~n); 9816#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9788#ackermannENTRY ~m := #in~m;~n := #in~n; 9881#L15 assume !(0 == ~m); 9815#L18 assume !(0 == ~n); 9798#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9826#L15 assume !(0 == ~m); 9827#L18 assume !(0 == ~n); 9795#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9870#L15 assume !(0 == ~m); 9869#L18 assume 0 == ~n; 9804#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9805#ackermannENTRY ~m := #in~m;~n := #in~n; 9899#L15 assume 0 == ~m;#res := 1 + ~n; 9867#ackermannFINAL assume true; 9887#ackermannEXIT >#42#return; 9888#L19-1 #res := #t~ret0;havoc #t~ret0; 10000#ackermannFINAL assume true; 9999#ackermannEXIT >#44#return; 9794#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9990#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 10001#ackermannFINAL assume true; 9991#ackermannEXIT >#44#return; 9809#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9986#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9979#ackermannFINAL assume true; 9945#ackermannEXIT >#44#return; 9923#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9941#ackermannENTRY ~m := #in~m;~n := #in~n; 9970#L15 assume 0 == ~m;#res := 1 + ~n; 9969#ackermannFINAL assume true; 9921#ackermannEXIT >#46#return; 9928#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9950#ackermannFINAL assume true; 9903#ackermannEXIT >#46#return; 9900#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9898#ackermannFINAL assume true; 9892#ackermannEXIT >#42#return; 9893#L19-1 #res := #t~ret0;havoc #t~ret0; 9997#ackermannFINAL assume true; 9996#ackermannEXIT >#44#return; 9873#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9882#ackermannENTRY ~m := #in~m;~n := #in~n; 9880#L15 assume !(0 == ~m); 9879#L18 assume !(0 == ~n); 9822#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9871#ackermannENTRY ~m := #in~m;~n := #in~n; 9872#L15 assume !(0 == ~m); 9878#L18 assume !(0 == ~n); 9796#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9811#ackermannENTRY ~m := #in~m;~n := #in~n; 9812#L15 assume !(0 == ~m); 9877#L18 assume !(0 == ~n); 9797#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9811#ackermannENTRY ~m := #in~m;~n := #in~n; 9813#L15 assume !(0 == ~m); 9949#L18 assume 0 == ~n; 9865#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9868#ackermannENTRY ~m := #in~m;~n := #in~n; 9866#L15 assume !(0 == ~m); 9862#L18 assume !(0 == ~n); 9790#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9913#ackermannENTRY ~m := #in~m;~n := #in~n; 9919#L15 assume !(0 == ~m); 9917#L18 assume 0 == ~n; 9864#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9868#ackermannENTRY ~m := #in~m;~n := #in~n; 9866#L15 assume !(0 == ~m); 9862#L18 assume !(0 == ~n); 9790#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9913#ackermannENTRY ~m := #in~m;~n := #in~n; 9919#L15 assume !(0 == ~m); 9917#L18 assume 0 == ~n; 9864#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9868#ackermannENTRY ~m := #in~m;~n := #in~n; 9866#L15 assume 0 == ~m;#res := 1 + ~n; 9867#ackermannFINAL assume true; 9887#ackermannEXIT >#42#return; 9889#L19-1 #res := #t~ret0;havoc #t~ret0; 9914#ackermannFINAL assume true; 9912#ackermannEXIT >#44#return; 9910#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9911#ackermannENTRY ~m := #in~m;~n := #in~n; 9916#L15 assume 0 == ~m;#res := 1 + ~n; 9915#ackermannFINAL assume true; 9909#ackermannEXIT >#46#return; 9908#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9907#ackermannFINAL assume true; 9895#ackermannEXIT >#42#return; 9896#L19-1 #res := #t~ret0;havoc #t~ret0; 9956#ackermannFINAL assume true; 9955#ackermannEXIT >#44#return; 9904#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9906#ackermannENTRY ~m := #in~m;~n := #in~n; 9954#L15 assume !(0 == ~m); 9952#L18 assume !(0 == ~n); 9816#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9788#ackermannENTRY ~m := #in~m;~n := #in~n; 9881#L15 assume !(0 == ~m); 9815#L18 assume !(0 == ~n); 9798#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9826#L15 assume !(0 == ~m); 9827#L18 assume !(0 == ~n); 9795#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9870#L15 assume !(0 == ~m); 9869#L18 assume 0 == ~n; 9804#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9805#ackermannENTRY ~m := #in~m;~n := #in~n; 9899#L15 assume 0 == ~m;#res := 1 + ~n; 9867#ackermannFINAL assume true; 9887#ackermannEXIT >#42#return; 9888#L19-1 #res := #t~ret0;havoc #t~ret0; 10000#ackermannFINAL assume true; 9999#ackermannEXIT >#44#return; 9794#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9990#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 10001#ackermannFINAL assume true; 9991#ackermannEXIT >#44#return; 9809#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9986#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9979#ackermannFINAL assume true; 9945#ackermannEXIT >#44#return; 9923#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9941#ackermannENTRY ~m := #in~m;~n := #in~n; 9970#L15 assume 0 == ~m;#res := 1 + ~n; 9969#ackermannFINAL assume true; 9921#ackermannEXIT >#46#return; 9928#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9950#ackermannFINAL assume true; 9903#ackermannEXIT >#46#return; 9900#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9898#ackermannFINAL assume true; 9892#ackermannEXIT >#42#return; 9893#L19-1 #res := #t~ret0;havoc #t~ret0; 9997#ackermannFINAL assume true; 9996#ackermannEXIT >#44#return; 9873#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9882#ackermannENTRY ~m := #in~m;~n := #in~n; 9880#L15 assume !(0 == ~m); 9879#L18 assume !(0 == ~n); 9822#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9871#ackermannENTRY ~m := #in~m;~n := #in~n; 9872#L15 assume !(0 == ~m); 9878#L18 assume !(0 == ~n); 9796#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9811#ackermannENTRY ~m := #in~m;~n := #in~n; 9812#L15 assume !(0 == ~m); 9877#L18 assume !(0 == ~n); 9797#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9811#ackermannENTRY ~m := #in~m;~n := #in~n; 9813#L15 assume !(0 == ~m); 9949#L18 assume 0 == ~n; 9865#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9868#ackermannENTRY ~m := #in~m;~n := #in~n; 9866#L15 assume 0 == ~m;#res := 1 + ~n; 9867#ackermannFINAL assume true; 9887#ackermannEXIT >#42#return; 9888#L19-1 #res := #t~ret0;havoc #t~ret0; 10000#ackermannFINAL assume true; 9999#ackermannEXIT >#44#return; 9794#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9990#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 10001#ackermannFINAL assume true; 9991#ackermannEXIT >#44#return; 9809#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9986#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9979#ackermannFINAL assume true; 9945#ackermannEXIT >#44#return; 9924#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9941#ackermannENTRY ~m := #in~m;~n := #in~n; 9970#L15 assume 0 == ~m;#res := 1 + ~n; 9969#ackermannFINAL assume true; 9921#ackermannEXIT >#46#return; 9929#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9981#ackermannFINAL assume true; 9980#ackermannEXIT >#46#return; 9800#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9803#ackermannFINAL assume true; 9828#ackermannEXIT >#44#return; 9787#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9884#ackermannENTRY ~m := #in~m;~n := #in~n; 9883#L15 assume !(0 == ~m); 9814#L18 assume !(0 == ~n); 9785#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9788#ackermannENTRY ~m := #in~m;~n := #in~n; 9881#L15 assume !(0 == ~m); 9815#L18 assume !(0 == ~n); 9798#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9826#L15 assume !(0 == ~m); 9827#L18 assume !(0 == ~n); 9795#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9870#L15 assume !(0 == ~m); 9869#L18 assume 0 == ~n; 9804#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9805#ackermannENTRY ~m := #in~m;~n := #in~n; 9899#L15 assume 0 == ~m;#res := 1 + ~n; 9867#ackermannFINAL assume true; 9887#ackermannEXIT >#42#return; 9888#L19-1 #res := #t~ret0;havoc #t~ret0; 10000#ackermannFINAL assume true; 9999#ackermannEXIT >#44#return; 9794#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9990#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 10001#ackermannFINAL assume true; 9991#ackermannEXIT >#44#return; 9809#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9986#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9979#ackermannFINAL assume true; 9945#ackermannEXIT >#44#return; 9924#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9941#ackermannENTRY ~m := #in~m;~n := #in~n; 9970#L15 assume 0 == ~m;#res := 1 + ~n; 9969#ackermannFINAL assume true; 9921#ackermannEXIT >#46#return; 9929#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9981#ackermannFINAL assume true; 9980#ackermannEXIT >#46#return; 9978#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9977#ackermannFINAL assume true; 9946#ackermannEXIT >#44#return; 9939#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9943#ackermannENTRY ~m := #in~m;~n := #in~n; 9976#L15 assume !(0 == ~m); 9975#L18 assume !(0 == ~n); 9817#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9788#ackermannENTRY ~m := #in~m;~n := #in~n; 9881#L15 assume !(0 == ~m); 9815#L18 assume !(0 == ~n); 9798#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9826#L15 assume !(0 == ~m); 9827#L18 assume !(0 == ~n); 9795#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9861#ackermannENTRY ~m := #in~m;~n := #in~n; 9870#L15 assume !(0 == ~m); 9869#L18 assume 0 == ~n; 9804#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9805#ackermannENTRY ~m := #in~m;~n := #in~n; 9899#L15 assume 0 == ~m;#res := 1 + ~n; 9867#ackermannFINAL assume true; 9887#ackermannEXIT >#42#return; 9888#L19-1 #res := #t~ret0;havoc #t~ret0; 10000#ackermannFINAL assume true; 9999#ackermannEXIT >#44#return; 9794#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9990#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 10001#ackermannFINAL assume true; 9991#ackermannEXIT >#44#return; 9809#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9799#ackermannENTRY ~m := #in~m;~n := #in~n; 9810#L15 assume 0 == ~m;#res := 1 + ~n; 9825#ackermannFINAL assume true; 9989#ackermannEXIT >#46#return; 9986#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9979#ackermannFINAL assume true; 9945#ackermannEXIT >#44#return; 9925#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9941#ackermannENTRY ~m := #in~m;~n := #in~n; 9970#L15 assume 0 == ~m;#res := 1 + ~n; 9969#ackermannFINAL assume true; 9921#ackermannEXIT >#46#return; 9930#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9967#ackermannFINAL assume true; 9937#ackermannEXIT >#46#return; 9936#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9995#ackermannFINAL assume true; 9992#ackermannEXIT >#46#return; 9993#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 9998#ackermannFINAL assume true; 9987#ackermannEXIT >#44#return; 9873#L21-1 [2019-11-16 00:26:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1247057107, now seen corresponding path program 7 times [2019-11-16 00:26:30,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:30,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005492874] [2019-11-16 00:26:30,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:30,740 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 982423659, now seen corresponding path program 5 times [2019-11-16 00:26:30,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:30,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122378455] [2019-11-16 00:26:30,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8596 backedges. 1948 proven. 3725 refuted. 0 times theorem prover too weak. 2923 trivial. 0 not checked. [2019-11-16 00:26:33,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122378455] [2019-11-16 00:26:33,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878164060] [2019-11-16 00:26:33,587 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:33,776 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-16 00:26:33,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:26:33,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-16 00:26:33,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8596 backedges. 817 proven. 1614 refuted. 0 times theorem prover too weak. 6165 trivial. 0 not checked. [2019-11-16 00:26:34,045 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:34,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 21] total 56 [2019-11-16 00:26:34,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616946699] [2019-11-16 00:26:34,047 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:26:34,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:34,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-11-16 00:26:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2880, Unknown=0, NotChecked=0, Total=3080 [2019-11-16 00:26:34,048 INFO L87 Difference]: Start difference. First operand 221 states and 281 transitions. cyclomatic complexity: 64 Second operand 56 states. [2019-11-16 00:26:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:40,567 INFO L93 Difference]: Finished difference Result 391 states and 563 transitions. [2019-11-16 00:26:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-11-16 00:26:40,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 391 states and 563 transitions. [2019-11-16 00:26:40,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-11-16 00:26:40,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 391 states to 351 states and 506 transitions. [2019-11-16 00:26:40,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2019-11-16 00:26:40,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2019-11-16 00:26:40,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 351 states and 506 transitions. [2019-11-16 00:26:40,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:40,580 INFO L688 BuchiCegarLoop]: Abstraction has 351 states and 506 transitions. [2019-11-16 00:26:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states and 506 transitions. [2019-11-16 00:26:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 236. [2019-11-16 00:26:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-16 00:26:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2019-11-16 00:26:40,592 INFO L711 BuchiCegarLoop]: Abstraction has 236 states and 306 transitions. [2019-11-16 00:26:40,593 INFO L591 BuchiCegarLoop]: Abstraction has 236 states and 306 transitions. [2019-11-16 00:26:40,593 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-16 00:26:40,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 236 states and 306 transitions. [2019-11-16 00:26:40,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2019-11-16 00:26:40,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:40,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:40,597 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 11, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2019-11-16 00:26:40,597 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [18, 15, 12, 8, 8, 6, 6, 6, 5, 5, 4, 4, 4, 4] [2019-11-16 00:26:40,597 INFO L791 eck$LassoCheckResult]: Stem: 13899#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 13858#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 13859#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 13868#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 13869#ackermannENTRY ~m := #in~m;~n := #in~n; 13926#L15 assume !(0 == ~m); 13928#L18 assume !(0 == ~n); 13920#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13923#ackermannENTRY ~m := #in~m;~n := #in~n; 13925#L15 assume !(0 == ~m); 13927#L18 assume !(0 == ~n); 13919#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13923#ackermannENTRY ~m := #in~m;~n := #in~n; 13924#L15 assume !(0 == ~m); 13918#L18 assume 0 == ~n; 13913#L19 call #t~ret0 := ackermann(~m - 1, 1);< 13916#ackermannENTRY ~m := #in~m;~n := #in~n; 13915#L15 assume !(0 == ~m); 13912#L18 assume !(0 == ~n); 13906#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13910#ackermannENTRY ~m := #in~m;~n := #in~n; 13908#L15 assume !(0 == ~m); 13905#L18 assume 0 == ~n; 13907#L19 call #t~ret0 := ackermann(~m - 1, 1);< 13885#ackermannENTRY ~m := #in~m;~n := #in~n; 13915#L15 assume !(0 == ~m); 13912#L18 assume !(0 == ~n); 13906#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13910#ackermannENTRY ~m := #in~m;~n := #in~n; 13908#L15 assume !(0 == ~m); 13905#L18 assume 0 == ~n; 13907#L19 call #t~ret0 := ackermann(~m - 1, 1);< 13885#ackermannENTRY ~m := #in~m;~n := #in~n; 13917#L15 assume 0 == ~m;#res := 1 + ~n; 14002#ackermannFINAL assume true; 14001#ackermannEXIT >#42#return; 14000#L19-1 #res := #t~ret0;havoc #t~ret0; 13999#ackermannFINAL assume true; 13997#ackermannEXIT >#44#return; 13994#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 13995#ackermannENTRY ~m := #in~m;~n := #in~n; 13998#L15 assume 0 == ~m;#res := 1 + ~n; 13996#ackermannFINAL assume true; 13993#ackermannEXIT >#46#return; 13992#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 13991#ackermannFINAL assume true; 13971#ackermannEXIT >#42#return; 13970#L19-1 #res := #t~ret0;havoc #t~ret0; 13969#ackermannFINAL assume true; 13967#ackermannEXIT >#44#return; 13968#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 14059#ackermannENTRY ~m := #in~m;~n := #in~n; 14058#L15 assume !(0 == ~m); 14056#L18 assume !(0 == ~n); 13896#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13864#ackermannENTRY ~m := #in~m;~n := #in~n; 13958#L15 assume !(0 == ~m); 13894#L18 assume !(0 == ~n); 13873#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13937#ackermannENTRY ~m := #in~m;~n := #in~n; 13901#L15 assume !(0 == ~m); 13902#L18 assume !(0 == ~n); 13871#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13937#ackermannENTRY ~m := #in~m;~n := #in~n; 13946#L15 assume !(0 == ~m); 13945#L18 assume 0 == ~n; 13881#L19 call #t~ret0 := ackermann(~m - 1, 1);< 13882#ackermannENTRY ~m := #in~m;~n := #in~n; 13990#L15 assume 0 == ~m;#res := 1 + ~n; 13943#ackermannFINAL assume true; 13988#ackermannEXIT >#42#return; 13989#L19-1 #res := #t~ret0;havoc #t~ret0; 14063#ackermannFINAL assume true; 14062#ackermannEXIT >#44#return; 13886#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 13875#ackermannENTRY ~m := #in~m;~n := #in~n; 13889#L15 assume 0 == ~m;#res := 1 + ~n; 13900#ackermannFINAL assume true; 14039#ackermannEXIT >#46#return; 14040#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 14061#ackermannFINAL assume true; 14060#ackermannEXIT >#44#return; 13888#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 13875#ackermannENTRY ~m := #in~m;~n := #in~n; 13889#L15 assume 0 == ~m;#res := 1 + ~n; 13900#ackermannFINAL assume true; 14039#ackermannEXIT >#46#return; 14042#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 14054#ackermannFINAL assume true; 14053#ackermannEXIT >#44#return; 14023#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 14028#ackermannENTRY ~m := #in~m;~n := #in~n; 14031#L15 assume 0 == ~m;#res := 1 + ~n; 14029#ackermannFINAL assume true; 14018#ackermannEXIT >#46#return; 14027#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 14092#ackermannFINAL assume true; 14091#ackermannEXIT >#46#return; 14087#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 14086#ackermannFINAL assume true; 14083#ackermannEXIT >#42#return; 14084#L19-1 #res := #t~ret0;havoc #t~ret0; 14064#ackermannFINAL assume true; 14052#ackermannEXIT >#44#return; 14011#L21-1 [2019-11-16 00:26:40,598 INFO L793 eck$LassoCheckResult]: Loop: 14011#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 14015#ackermannENTRY ~m := #in~m;~n := #in~n; 14034#L15 assume !(0 == ~m); 14032#L18 assume !(0 == ~n); 13877#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13947#ackermannENTRY ~m := #in~m;~n := #in~n; 13948#L15 assume !(0 == ~m); 13950#L18 assume !(0 == ~n); 13872#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13890#ackermannENTRY ~m := #in~m;~n := #in~n; 13891#L15 assume !(0 == ~m); 13951#L18 assume !(0 == ~n); 13874#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13890#ackermannENTRY ~m := #in~m;~n := #in~n; 13892#L15 assume !(0 == ~m); 13979#L18 assume 0 == ~n; 13941#L19 call #t~ret0 := ackermann(~m - 1, 1);< 13944#ackermannENTRY ~m := #in~m;~n := #in~n; 13942#L15 assume !(0 == ~m); 13938#L18 assume !(0 == ~n); 13866#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13935#ackermannENTRY ~m := #in~m;~n := #in~n; 13936#L15 assume !(0 == ~m); 13978#L18 assume 0 == ~n; 13940#L19 call #t~ret0 := ackermann(~m - 1, 1);< 13944#ackermannENTRY ~m := #in~m;~n := #in~n; 13942#L15 assume !(0 == ~m); 13938#L18 assume !(0 == ~n); 13866#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13935#ackermannENTRY ~m := #in~m;~n := #in~n; 13936#L15 assume !(0 == ~m); 13978#L18 assume 0 == ~n; 13940#L19 call #t~ret0 := ackermann(~m - 1, 1);< 13944#ackermannENTRY ~m := #in~m;~n := #in~n; 13942#L15 assume 0 == ~m;#res := 1 + ~n; 13943#ackermannFINAL assume true; 13988#ackermannEXIT >#42#return; 13987#L19-1 #res := #t~ret0;havoc #t~ret0; 13986#ackermannFINAL assume true; 13985#ackermannEXIT >#44#return; 13981#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 13982#ackermannENTRY ~m := #in~m;~n := #in~n; 13984#L15 assume 0 == ~m;#res := 1 + ~n; 13983#ackermannFINAL assume true; 13980#ackermannEXIT >#46#return; 13977#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 13974#ackermannFINAL assume true; 13972#ackermannEXIT >#42#return; 13970#L19-1 #res := #t~ret0;havoc #t~ret0; 13969#ackermannFINAL assume true; 13967#ackermannEXIT >#44#return; 13968#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 14059#ackermannENTRY ~m := #in~m;~n := #in~n; 14058#L15 assume !(0 == ~m); 14056#L18 assume !(0 == ~n); 13896#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13864#ackermannENTRY ~m := #in~m;~n := #in~n; 13958#L15 assume !(0 == ~m); 13894#L18 assume !(0 == ~n); 13873#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13937#ackermannENTRY ~m := #in~m;~n := #in~n; 13901#L15 assume !(0 == ~m); 13902#L18 assume !(0 == ~n); 13871#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 13937#ackermannENTRY ~m := #in~m;~n := #in~n; 13946#L15 assume !(0 == ~m); 13945#L18 assume 0 == ~n; 13881#L19 call #t~ret0 := ackermann(~m - 1, 1);< 13882#ackermannENTRY ~m := #in~m;~n := #in~n; 13990#L15 assume 0 == ~m;#res := 1 + ~n; 13943#ackermannFINAL assume true; 13988#ackermannEXIT >#42#return; 13989#L19-1 #res := #t~ret0;havoc #t~ret0; 14063#ackermannFINAL assume true; 14062#ackermannEXIT >#44#return; 13886#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 13875#ackermannENTRY ~m := #in~m;~n := #in~n; 13889#L15 assume 0 == ~m;#res := 1 + ~n; 13900#ackermannFINAL assume true; 14039#ackermannEXIT >#46#return; 14040#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 14061#ackermannFINAL assume true; 14060#ackermannEXIT >#44#return; 13888#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 13875#ackermannENTRY ~m := #in~m;~n := #in~n; 13889#L15 assume 0 == ~m;#res := 1 + ~n; 13900#ackermannFINAL assume true; 14039#ackermannEXIT >#46#return; 14042#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 14054#ackermannFINAL assume true; 14053#ackermannEXIT >#44#return; 14023#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 14028#ackermannENTRY ~m := #in~m;~n := #in~n; 14031#L15 assume 0 == ~m;#res := 1 + ~n; 14029#ackermannFINAL assume true; 14018#ackermannEXIT >#46#return; 14027#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 14092#ackermannFINAL assume true; 14091#ackermannEXIT >#46#return; 14087#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 14086#ackermannFINAL assume true; 14083#ackermannEXIT >#42#return; 14084#L19-1 #res := #t~ret0;havoc #t~ret0; 14064#ackermannFINAL assume true; 14052#ackermannEXIT >#44#return; 14011#L21-1 [2019-11-16 00:26:40,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:40,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1247057107, now seen corresponding path program 8 times [2019-11-16 00:26:40,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:40,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680184392] [2019-11-16 00:26:40,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:40,623 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:40,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1507585948, now seen corresponding path program 6 times [2019-11-16 00:26:40,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:40,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738308906] [2019-11-16 00:26:40,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:40,649 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:40,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:40,650 INFO L82 PathProgramCache]: Analyzing trace with hash 647333560, now seen corresponding path program 9 times [2019-11-16 00:26:40,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:40,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316579667] [2019-11-16 00:26:40,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2574 backedges. 563 proven. 1015 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2019-11-16 00:26:41,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316579667] [2019-11-16 00:26:41,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643729726] [2019-11-16 00:26:41,824 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:42,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-11-16 00:26:42,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:26:42,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:26:42,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2574 backedges. 540 proven. 366 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-16 00:26:42,262 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:42,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 11] total 45 [2019-11-16 00:26:42,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345026795] [2019-11-16 00:26:43,528 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:43,528 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:43,529 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:43,529 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:43,529 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:43,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:43,529 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:43,529 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:43,529 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration14_Loop [2019-11-16 00:26:43,529 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:43,529 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:43,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:43,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:43,538 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:26:43,539 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:26:43,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:43,605 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:43,605 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:43,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:43,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:43,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:43,611 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:43,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:43,616 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:43,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:43,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:26:45,886 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:26:45,888 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:45,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:45,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:45,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:45,888 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:26:45,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:45,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:45,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:45,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration14_Loop [2019-11-16 00:26:45,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:45,889 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:45,889 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:26:45,890 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:26:45,892 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:26:45,893 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:26:45,900 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:26:45,948 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:45,948 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:26:45,948 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:26:45,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:45,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:45,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:45,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:45,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:45,950 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:45,950 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:45,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:45,950 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:26:45,951 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:45,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:45,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:45,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:45,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:45,951 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:45,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:45,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:45,951 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:26:45,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:45,952 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:45,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:45,952 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:45,952 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:45,952 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:45,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:45,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:45,953 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:26:45,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:45,953 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:45,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:45,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:45,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:45,954 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:45,954 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:45,956 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:26:45,963 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:26:45,964 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:26:45,964 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:26:45,964 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:26:45,965 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:26:45,965 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#t~ret1) = -1*ackermann_#t~ret1 + 4 Supporting invariants [] [2019-11-16 00:26:45,965 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:26:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:46,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-16 00:26:46,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:46,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:46,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-16 00:26:46,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 199 proven. 210 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-16 00:26:46,695 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 24 loop predicates [2019-11-16 00:26:46,695 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 236 states and 306 transitions. cyclomatic complexity: 74 Second operand 26 states. [2019-11-16 00:26:46,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 236 states and 306 transitions. cyclomatic complexity: 74. Second operand 26 states. Result 241 states and 311 transitions. Complement of second has 13 states. [2019-11-16 00:26:46,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:26:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-11-16 00:26:46,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 104 letters. Loop has 105 letters. [2019-11-16 00:26:46,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:46,910 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:26:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:47,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-16 00:26:47,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:47,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:47,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-16 00:26:47,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 199 proven. 210 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-16 00:26:47,718 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 24 loop predicates [2019-11-16 00:26:47,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 236 states and 306 transitions. cyclomatic complexity: 74 Second operand 26 states. [2019-11-16 00:26:47,956 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 236 states and 306 transitions. cyclomatic complexity: 74. Second operand 26 states. Result 241 states and 311 transitions. Complement of second has 13 states. [2019-11-16 00:26:47,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:26:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-11-16 00:26:47,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 104 letters. Loop has 105 letters. [2019-11-16 00:26:47,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:47,958 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:26:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:48,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-16 00:26:48,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:48,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:48,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-16 00:26:48,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 199 proven. 210 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-16 00:26:48,748 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 24 loop predicates [2019-11-16 00:26:48,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 236 states and 306 transitions. cyclomatic complexity: 74 Second operand 26 states. [2019-11-16 00:26:52,682 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 236 states and 306 transitions. cyclomatic complexity: 74. Second operand 26 states. Result 1571 states and 1949 transitions. Complement of second has 538 states. [2019-11-16 00:26:52,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 61 states 2 stem states 58 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:26:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 135 transitions. [2019-11-16 00:26:52,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 135 transitions. Stem has 104 letters. Loop has 105 letters. [2019-11-16 00:26:52,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:52,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 135 transitions. Stem has 209 letters. Loop has 105 letters. [2019-11-16 00:26:52,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:52,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 135 transitions. Stem has 104 letters. Loop has 210 letters. [2019-11-16 00:26:52,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:52,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1571 states and 1949 transitions. [2019-11-16 00:26:52,711 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 187 [2019-11-16 00:26:52,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1571 states to 779 states and 1012 transitions. [2019-11-16 00:26:52,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 543 [2019-11-16 00:26:52,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 595 [2019-11-16 00:26:52,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 779 states and 1012 transitions. [2019-11-16 00:26:52,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:52,725 INFO L688 BuchiCegarLoop]: Abstraction has 779 states and 1012 transitions. [2019-11-16 00:26:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states and 1012 transitions. [2019-11-16 00:26:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 590. [2019-11-16 00:26:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-11-16 00:26:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 756 transitions. [2019-11-16 00:26:52,748 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 756 transitions. [2019-11-16 00:26:52,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-16 00:26:52,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1910, Unknown=0, NotChecked=0, Total=2070 [2019-11-16 00:26:52,750 INFO L87 Difference]: Start difference. First operand 590 states and 756 transitions. Second operand 46 states. [2019-11-16 00:26:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:57,266 INFO L93 Difference]: Finished difference Result 495 states and 559 transitions. [2019-11-16 00:26:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-11-16 00:26:57,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 559 transitions. [2019-11-16 00:26:57,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-16 00:26:57,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 425 states and 478 transitions. [2019-11-16 00:26:57,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 328 [2019-11-16 00:26:57,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2019-11-16 00:26:57,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 425 states and 478 transitions. [2019-11-16 00:26:57,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:26:57,279 INFO L688 BuchiCegarLoop]: Abstraction has 425 states and 478 transitions. [2019-11-16 00:26:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states and 478 transitions. [2019-11-16 00:26:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 351. [2019-11-16 00:26:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-16 00:26:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 390 transitions. [2019-11-16 00:26:57,290 INFO L711 BuchiCegarLoop]: Abstraction has 351 states and 390 transitions. [2019-11-16 00:26:57,291 INFO L591 BuchiCegarLoop]: Abstraction has 351 states and 390 transitions. [2019-11-16 00:26:57,291 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-16 00:26:57,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 351 states and 390 transitions. [2019-11-16 00:26:57,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-16 00:26:57,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:26:57,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:26:57,295 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [22, 16, 15, 10, 10, 6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-11-16 00:26:57,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 1, 1] [2019-11-16 00:26:57,295 INFO L791 eck$LassoCheckResult]: Stem: 21513#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 21480#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 21481#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 21490#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 21491#ackermannENTRY ~m := #in~m;~n := #in~n; 21540#L15 assume !(0 == ~m); 21681#L18 assume !(0 == ~n); 21534#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21537#ackermannENTRY ~m := #in~m;~n := #in~n; 21538#L15 assume !(0 == ~m); 21539#L18 assume !(0 == ~n); 21533#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21537#ackermannENTRY ~m := #in~m;~n := #in~n; 21536#L15 assume !(0 == ~m); 21535#L18 assume 0 == ~n; 21527#L19 call #t~ret0 := ackermann(~m - 1, 1);< 21531#ackermannENTRY ~m := #in~m;~n := #in~n; 21532#L15 assume !(0 == ~m); 21526#L18 assume !(0 == ~n); 21519#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21523#ackermannENTRY ~m := #in~m;~n := #in~n; 21524#L15 assume !(0 == ~m); 21518#L18 assume 0 == ~n; 21520#L19 call #t~ret0 := ackermann(~m - 1, 1);< 21501#ackermannENTRY ~m := #in~m;~n := #in~n; 21528#L15 assume !(0 == ~m); 21529#L18 assume !(0 == ~n); 21500#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21525#ackermannENTRY ~m := #in~m;~n := #in~n; 21521#L15 assume !(0 == ~m); 21522#L18 assume 0 == ~n; 21499#L19 call #t~ret0 := ackermann(~m - 1, 1);< 21501#ackermannENTRY ~m := #in~m;~n := #in~n; 21530#L15 assume 0 == ~m;#res := 1 + ~n; 21571#ackermannFINAL assume true; 21547#ackermannEXIT >#42#return; 21548#L19-1 #res := #t~ret0;havoc #t~ret0; 21578#ackermannFINAL assume true; 21577#ackermannEXIT >#44#return; 21575#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 21576#ackermannENTRY ~m := #in~m;~n := #in~n; 21580#L15 assume 0 == ~m;#res := 1 + ~n; 21579#ackermannFINAL assume true; 21574#ackermannEXIT >#46#return; 21573#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 21572#ackermannFINAL assume true; 21570#ackermannEXIT >#42#return; 21564#L19-1 #res := #t~ret0;havoc #t~ret0; 21560#ackermannFINAL assume true; 21558#ackermannEXIT >#44#return; 21555#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 21556#ackermannENTRY ~m := #in~m;~n := #in~n; 21582#L15 assume !(0 == ~m); 21581#L18 assume !(0 == ~n); 21568#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21569#ackermannENTRY ~m := #in~m;~n := #in~n; 21661#L15 assume !(0 == ~m); 21660#L18 assume !(0 == ~n); 21493#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21505#ackermannENTRY ~m := #in~m;~n := #in~n; 21506#L15 assume !(0 == ~m); 21827#L18 assume !(0 == ~n); 21488#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21826#ackermannENTRY ~m := #in~m;~n := #in~n; 21830#L15 assume !(0 == ~m); 21829#L18 assume 0 == ~n; 21585#L19 call #t~ret0 := ackermann(~m - 1, 1);< 21551#ackermannENTRY ~m := #in~m;~n := #in~n; 21591#L15 assume 0 == ~m;#res := 1 + ~n; 21583#ackermannFINAL assume true; 21587#ackermannEXIT >#42#return; 21512#L19-1 #res := #t~ret0;havoc #t~ret0; 21503#ackermannFINAL assume true; 21517#ackermannEXIT >#44#return; 21492#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 21494#ackermannENTRY ~m := #in~m;~n := #in~n; 21504#L15 assume 0 == ~m;#res := 1 + ~n; 21514#ackermannFINAL assume true; 21823#ackermannEXIT >#46#return; 21814#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 21812#ackermannFINAL assume true; 21659#ackermannEXIT >#44#return; 21631#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 21632#ackermannENTRY ~m := #in~m;~n := #in~n; 21664#L15 assume 0 == ~m;#res := 1 + ~n; 21658#ackermannFINAL assume true; 21630#ackermannEXIT >#46#return; 21628#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 21588#ackermannFINAL assume true; 21567#ackermannEXIT >#44#return; 21562#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 21563#ackermannENTRY ~m := #in~m;~n := #in~n; 21566#L15 assume 0 == ~m;#res := 1 + ~n; 21565#ackermannFINAL assume true; 21561#ackermannEXIT >#46#return; 21559#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 21557#ackermannFINAL assume true; 21554#ackermannEXIT >#46#return; 21553#L21-2 #res := #t~ret2;havoc #t~ret2;havoc #t~ret1; 21552#ackermannFINAL assume true; 21549#ackermannEXIT >#42#return; 21550#L19-1 #res := #t~ret0;havoc #t~ret0; 21673#ackermannFINAL assume true; 21672#ackermannEXIT >#44#return; 21656#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 21665#ackermannENTRY ~m := #in~m;~n := #in~n; 21666#L15 assume !(0 == ~m); 21655#L18 assume !(0 == ~n); 21650#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21649#ackermannENTRY ~m := #in~m;~n := #in~n; 21651#L15 assume !(0 == ~m); 21671#L18 assume !(0 == ~n); 21639#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21642#ackermannENTRY ~m := #in~m;~n := #in~n; 21640#L15 assume !(0 == ~m); 21638#L18 assume !(0 == ~n); 21620#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21733#ackermannENTRY ~m := #in~m;~n := #in~n; 21629#L15 assume !(0 == ~m); 21623#L18 assume 0 == ~n; 21544#L19 call #t~ret0 := ackermann(~m - 1, 1);< 21608#ackermannENTRY ~m := #in~m;~n := #in~n; 21604#L15 assume !(0 == ~m); 21601#L18 [2019-11-16 00:26:57,296 INFO L793 eck$LassoCheckResult]: Loop: 21601#L18 assume !(0 == ~n); 21597#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21598#ackermannENTRY ~m := #in~m;~n := #in~n; 21614#L15 assume !(0 == ~m); 21615#L18 assume !(0 == ~n); 21622#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21636#ackermannENTRY ~m := #in~m;~n := #in~n; 21633#L15 assume !(0 == ~m); 21618#L18 assume !(0 == ~n); 21613#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 21619#ackermannENTRY ~m := #in~m;~n := #in~n; 21617#L15 assume !(0 == ~m); 21616#L18 assume 0 == ~n; 21545#L19 call #t~ret0 := ackermann(~m - 1, 1);< 21607#ackermannENTRY ~m := #in~m;~n := #in~n; 21603#L15 assume !(0 == ~m); 21601#L18 [2019-11-16 00:26:57,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:57,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1871853113, now seen corresponding path program 10 times [2019-11-16 00:26:57,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:57,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550576335] [2019-11-16 00:26:57,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:57,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:57,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 456 proven. 73 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-11-16 00:26:57,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550576335] [2019-11-16 00:26:57,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878677632] [2019-11-16 00:26:57,810 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:58,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:26:58,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:26:58,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-16 00:26:58,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 435 proven. 85 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-11-16 00:26:58,051 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:58,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 28 [2019-11-16 00:26:58,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965328845] [2019-11-16 00:26:58,052 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:26:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1601829226, now seen corresponding path program 2 times [2019-11-16 00:26:58,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:58,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099574694] [2019-11-16 00:26:58,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:58,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:58,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:26:58,059 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:26:58,530 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:58,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:58,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:58,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:58,530 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:26:58,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:58,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:58,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:58,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration15_Loop [2019-11-16 00:26:58,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:58,531 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:58,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:58,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:58,535 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:26:58,545 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:26:58,546 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:26:58,559 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:26:58,678 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:58,678 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:58,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:58,690 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:58,694 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:58,694 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:58,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:58,700 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:58,703 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:26:58,704 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:58,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:26:58,709 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9842d935-e170-4b62-979c-78a568fd16b8/bin/uautomizer/z3 Starting monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:26:58,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:26:58,722 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:58,878 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:26:58,879 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:26:58,880 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:26:58,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:26:58,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:26:58,880 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:26:58,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:26:58,880 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:26:58,880 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:26:58,880 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration15_Loop [2019-11-16 00:26:58,880 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:26:58,880 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:26:58,881 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:26:58,890 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:26:58,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:26:58,899 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:26:58,900 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:26:58,913 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:26:59,047 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:26:59,047 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:26:59,047 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:26:59,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:59,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:59,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:59,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:59,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:59,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:59,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:59,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:26:59,049 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:26:59,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:26:59,049 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:26:59,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:26:59,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:26:59,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:26:59,050 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:26:59,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:26:59,055 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:26:59,056 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:26:59,058 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:26:59,058 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:26:59,058 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:26:59,058 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:26:59,058 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [] [2019-11-16 00:26:59,059 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:26:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:59,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:26:59,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:59,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:59,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:26:59,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:59,414 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:26:59,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 351 states and 390 transitions. cyclomatic complexity: 44 Second operand 13 states. [2019-11-16 00:26:59,644 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 351 states and 390 transitions. cyclomatic complexity: 44. Second operand 13 states. Result 397 states and 449 transitions. Complement of second has 26 states. [2019-11-16 00:26:59,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-16 00:26:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:26:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2019-11-16 00:26:59,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 123 letters. Loop has 16 letters. [2019-11-16 00:26:59,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:26:59,645 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:26:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:59,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:26:59,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:59,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:59,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:26:59,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:59,987 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:26:59,987 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 351 states and 390 transitions. cyclomatic complexity: 44 Second operand 13 states. [2019-11-16 00:27:00,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 351 states and 390 transitions. cyclomatic complexity: 44. Second operand 13 states. Result 416 states and 472 transitions. Complement of second has 33 states. [2019-11-16 00:27:00,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:27:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2019-11-16 00:27:00,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 26 transitions. Stem has 123 letters. Loop has 16 letters. [2019-11-16 00:27:00,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:00,257 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:27:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:00,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:27:00,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:00,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:00,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:27:00,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:00,608 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:27:00,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 351 states and 390 transitions. cyclomatic complexity: 44 Second operand 13 states. [2019-11-16 00:27:00,818 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 351 states and 390 transitions. cyclomatic complexity: 44. Second operand 13 states. Result 702 states and 786 transitions. Complement of second has 73 states. [2019-11-16 00:27:00,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:27:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2019-11-16 00:27:00,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 123 letters. Loop has 16 letters. [2019-11-16 00:27:00,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:00,820 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:27:00,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:00,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:27:00,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:00,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:00,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:01,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:01,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:27:01,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:01,181 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2019-11-16 00:27:01,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 351 states and 390 transitions. cyclomatic complexity: 44 Second operand 13 states. [2019-11-16 00:27:01,771 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 351 states and 390 transitions. cyclomatic complexity: 44. Second operand 13 states. Result 1322 states and 1521 transitions. Complement of second has 274 states. [2019-11-16 00:27:01,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:27:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 69 transitions. [2019-11-16 00:27:01,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 69 transitions. Stem has 123 letters. Loop has 16 letters. [2019-11-16 00:27:01,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:01,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 69 transitions. Stem has 139 letters. Loop has 16 letters. [2019-11-16 00:27:01,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:01,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 69 transitions. Stem has 123 letters. Loop has 32 letters. [2019-11-16 00:27:01,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:01,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1322 states and 1521 transitions. [2019-11-16 00:27:01,789 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:27:01,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1322 states to 0 states and 0 transitions. [2019-11-16 00:27:01,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:27:01,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:27:01,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:27:01,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:27:01,790 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:01,790 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:01,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-16 00:27:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:27:01,791 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 28 states. [2019-11-16 00:27:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:01,791 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-16 00:27:01,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:27:01,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-16 00:27:01,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:27:01,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:27:01,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:27:01,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:27:01,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:27:01,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:27:01,793 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:01,793 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:01,794 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:01,794 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-16 00:27:01,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:27:01,794 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:27:01,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:27:01,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:27:01 BoogieIcfgContainer [2019-11-16 00:27:01,800 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:27:01,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:27:01,801 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:27:01,801 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:27:01,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:04" (3/4) ... [2019-11-16 00:27:01,805 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:27:01,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:27:01,807 INFO L168 Benchmark]: Toolchain (without parser) took 58317.85 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 727.7 MB). Free memory was 947.8 MB in the beginning and 1.0 GB in the end (delta: -90.2 MB). Peak memory consumption was 637.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:01,808 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:01,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 947.8 MB in the beginning and 1.2 GB in the end (delta: -212.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:01,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:01,809 INFO L168 Benchmark]: Boogie Preprocessor took 18.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:01,812 INFO L168 Benchmark]: RCFGBuilder took 395.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:01,812 INFO L168 Benchmark]: BuchiAutomizer took 57574.70 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 562.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.2 MB). Peak memory consumption was 666.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:01,813 INFO L168 Benchmark]: Witness Printer took 4.72 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:01,815 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 947.8 MB in the beginning and 1.2 GB in the end (delta: -212.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 395.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 57574.70 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 562.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.2 MB). Peak memory consumption was 666.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.72 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (11 trivial, 4 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 5 locations. One deterministic module has affine ranking function -2 * \old(n) + 1 and consists of 4 locations. One deterministic module has affine ranking function \old(m) and consists of 11 locations. One deterministic module has affine ranking function m and consists of 12 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. One nondeterministic module has affine ranking function \old(n) and consists of 25 locations. One nondeterministic module has affine ranking function -1 * aux-ackermann(m,n-1)-aux + 4 and consists of 61 locations. One nondeterministic module has affine ranking function n and consists of 16 locations. 11 modules have a trivial ranking function, the largest among these consists of 56 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 57.5s and 16 iterations. TraceHistogramMax:61. Analysis of lassos took 26.6s. Construction of modules took 7.1s. Büchi inclusion checks took 22.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 17. Automata minimization 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 604 StatesRemovedByMinimization, 17 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 351 states and ocurred in iteration 14. Nontrivial modules had stage [3, 1, 3, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 466/689 HoareTripleCheckerStatistics: 563 SDtfs, 1314 SDslu, 1680 SDs, 0 SdLazy, 8647 SolverSat, 2911 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT3 SILN2 SILU0 SILI2 SILT1 lasso4 LassoPreprocessingBenchmarks: Lassos: inital27 mio100 ax100 hnf100 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq191 hnf94 smp94 dnf155 smp94 tf103 neg95 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 306ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 87 LassoNonterminationAnalysisSatUnbounded: 6 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...