./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Ex08.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0f19c27ba74e1ebec32cb641e6640521812ace19 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:03:42,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:03:42,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:03:42,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:03:42,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:03:42,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:03:42,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:03:42,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:03:42,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:03:42,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:03:42,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:03:42,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:03:42,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:03:42,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:03:42,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:03:42,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:03:42,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:03:42,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:03:42,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:03:42,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:03:42,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:03:42,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:03:42,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:03:42,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:03:42,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:03:42,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:03:42,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:03:42,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:03:42,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:03:42,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:03:42,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:03:42,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:03:42,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:03:42,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:03:42,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:03:42,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:03:42,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:03:42,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:03:42,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:03:42,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:03:42,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:03:42,798 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:03:42,819 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:03:42,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:03:42,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:03:42,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:03:42,828 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:03:42,828 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:03:42,828 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:03:42,829 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:03:42,829 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:03:42,829 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:03:42,831 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:03:42,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:03:42,832 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:03:42,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:03:42,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:03:42,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:03:42,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:03:42,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:03:42,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:03:42,834 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:03:42,834 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:03:42,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:03:42,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:03:42,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:03:42,836 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:03:42,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:03:42,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:03:42,837 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:03:42,839 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:03:42,840 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_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f19c27ba74e1ebec32cb641e6640521812ace19 [2019-11-16 00:03:42,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:03:42,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:03:42,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:03:42,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:03:42,928 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:03:42,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/Ex08.c [2019-11-16 00:03:42,999 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/data/227a5f350/0e7877d4e6064bef8ce28c00aa02b718/FLAG158db6b97 [2019-11-16 00:03:43,498 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:03:43,499 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/sv-benchmarks/c/termination-restricted-15/Ex08.c [2019-11-16 00:03:43,507 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/data/227a5f350/0e7877d4e6064bef8ce28c00aa02b718/FLAG158db6b97 [2019-11-16 00:03:43,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/data/227a5f350/0e7877d4e6064bef8ce28c00aa02b718 [2019-11-16 00:03:43,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:03:43,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:03:43,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:43,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:03:43,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:03:43,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441db127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43, skipping insertion in model container [2019-11-16 00:03:43,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,949 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:03:43,965 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:03:44,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:44,279 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:03:44,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:44,323 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:03:44,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44 WrapperNode [2019-11-16 00:03:44,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:44,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:44,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:03:44,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:03:44,337 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:03:44" (1/1) ... [2019-11-16 00:03:44,344 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:03:44" (1/1) ... [2019-11-16 00:03:44,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:44,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:03:44,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:03:44,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:03:44,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44" (1/1) ... [2019-11-16 00:03:44,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44" (1/1) ... [2019-11-16 00:03:44,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44" (1/1) ... [2019-11-16 00:03:44,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44" (1/1) ... [2019-11-16 00:03:44,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44" (1/1) ... [2019-11-16 00:03:44,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44" (1/1) ... [2019-11-16 00:03:44,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44" (1/1) ... [2019-11-16 00:03:44,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:03:44,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:03:44,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:03:44,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:03:44,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:03:44,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:03:44,654 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:03:44,654 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:03:44,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:44 BoogieIcfgContainer [2019-11-16 00:03:44,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:03:44,657 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:03:44,657 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:03:44,661 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:03:44,662 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:03:44,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:03:43" (1/3) ... [2019-11-16 00:03:44,664 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cfd64ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:03:44, skipping insertion in model container [2019-11-16 00:03:44,664 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:03:44,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:44" (2/3) ... [2019-11-16 00:03:44,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cfd64ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:03:44, skipping insertion in model container [2019-11-16 00:03:44,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:03:44,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:44" (3/3) ... [2019-11-16 00:03:44,668 INFO L371 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2019-11-16 00:03:44,745 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:03:44,745 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:03:44,745 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:03:44,745 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:03:44,746 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:03:44,746 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:03:44,746 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:03:44,746 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:03:44,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-16 00:03:44,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:03:44,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:44,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:44,807 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:03:44,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:44,808 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:03:44,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-16 00:03:44,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:03:44,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:44,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:44,810 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:03:44,811 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:44,820 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5#L18-1true [2019-11-16 00:03:44,821 INFO L793 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(main_~i~0 > 0); 6#L12true assume 1 == main_~i~0;main_~up~0 := 1; 3#L12-2true assume 10 == main_~i~0;main_~up~0 := 0; 9#L15-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2019-11-16 00:03:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-16 00:03:44,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:44,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824987362] [2019-11-16 00:03:44,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:44,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:44,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:44,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:44,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2019-11-16 00:03:44,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:44,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140198997] [2019-11-16 00:03:44,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:44,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:44,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:45,059 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:03:45,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140198997] [2019-11-16 00:03:45,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:45,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:45,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605145815] [2019-11-16 00:03:45,068 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:45,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:45,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:45,096 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-11-16 00:03:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:45,186 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2019-11-16 00:03:45,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:45,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2019-11-16 00:03:45,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:03:45,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 14 transitions. [2019-11-16 00:03:45,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:03:45,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:03:45,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2019-11-16 00:03:45,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:03:45,209 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-11-16 00:03:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2019-11-16 00:03:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-16 00:03:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:03:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-11-16 00:03:45,249 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-11-16 00:03:45,250 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-11-16 00:03:45,250 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:03:45,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2019-11-16 00:03:45,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:03:45,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:45,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:45,252 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:03:45,252 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:45,252 INFO L791 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 34#L18-1 [2019-11-16 00:03:45,252 INFO L793 eck$LassoCheckResult]: Loop: 34#L18-1 assume !!(main_~i~0 > 0); 39#L12 assume !(1 == main_~i~0); 37#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 38#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 34#L18-1 [2019-11-16 00:03:45,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-16 00:03:45,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:45,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238090013] [2019-11-16 00:03:45,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:45,263 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2019-11-16 00:03:45,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:45,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097829875] [2019-11-16 00:03:45,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:45,289 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:03:45,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097829875] [2019-11-16 00:03:45,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:45,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:45,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958459848] [2019-11-16 00:03:45,291 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:45,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:45,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:45,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:45,292 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:03:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:45,311 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2019-11-16 00:03:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:45,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2019-11-16 00:03:45,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-16 00:03:45,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 20 transitions. [2019-11-16 00:03:45,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:03:45,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:03:45,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2019-11-16 00:03:45,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:03:45,316 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-11-16 00:03:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2019-11-16 00:03:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-16 00:03:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:03:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2019-11-16 00:03:45,320 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-11-16 00:03:45,320 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-11-16 00:03:45,320 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:03:45,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2019-11-16 00:03:45,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-16 00:03:45,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:45,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:45,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:03:45,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:45,322 INFO L791 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 62#L18-1 [2019-11-16 00:03:45,323 INFO L793 eck$LassoCheckResult]: Loop: 62#L18-1 assume !!(main_~i~0 > 0); 71#L12 assume !(1 == main_~i~0); 70#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 66#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 62#L18-1 [2019-11-16 00:03:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-16 00:03:45,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:45,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794602338] [2019-11-16 00:03:45,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:45,332 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1236462, now seen corresponding path program 1 times [2019-11-16 00:03:45,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:45,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006666565] [2019-11-16 00:03:45,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:45,349 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash 29865613, now seen corresponding path program 1 times [2019-11-16 00:03:45,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:45,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143993472] [2019-11-16 00:03:45,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:45,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:45,366 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:45,452 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:45,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:45,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:45,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:45,454 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:45,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:45,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:45,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:45,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2019-11-16 00:03:45,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:45,456 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:45,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:45,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:45,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:45,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:45,644 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:45,644 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:45,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:45,654 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:03:45,670 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:45,670 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:03:45,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:45,685 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:45,692 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:45,692 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:03:45,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:45,714 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:45,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:45,720 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:03:45,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:45,737 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:45,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:45,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:45,759 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:45,764 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:45,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:45,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:45,765 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:45,765 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:45,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:45,765 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:45,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:45,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2019-11-16 00:03:45,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:45,766 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:45,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:45,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:45,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:45,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:45,899 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:45,906 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:45,909 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:03:45,913 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:45,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:45,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:45,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:45,927 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:45,928 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:45,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:45,954 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:03:45,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:45,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:45,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:45,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:45,958 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:45,958 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:45,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:45,989 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:03:45,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:45,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:45,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:45,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:45,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:45,992 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:45,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:45,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:45,995 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:03:45,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:45,996 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:45,996 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:45,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:45,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:45,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:45,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:46,006 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:46,013 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:46,013 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:46,015 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:46,016 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:46,016 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:46,025 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:46,029 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:46,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:46,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:46,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:46,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:46,119 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:03:46,123 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:03:46,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:03:46,200 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 43 transitions. Complement of second has 5 states. [2019-11-16 00:03:46,203 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:03:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:03:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-16 00:03:46,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-16 00:03:46,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:46,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:03:46,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:46,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2019-11-16 00:03:46,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:46,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2019-11-16 00:03:46,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-16 00:03:46,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 40 transitions. [2019-11-16 00:03:46,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-16 00:03:46,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:03:46,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 40 transitions. [2019-11-16 00:03:46,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:46,222 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2019-11-16 00:03:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 40 transitions. [2019-11-16 00:03:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-16 00:03:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:03:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2019-11-16 00:03:46,232 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2019-11-16 00:03:46,232 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2019-11-16 00:03:46,233 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:03:46,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2019-11-16 00:03:46,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-16 00:03:46,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:46,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:46,238 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:03:46,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:46,239 INFO L791 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 141#L18-1 assume !!(main_~i~0 > 0); 152#L12 assume 1 == main_~i~0;main_~up~0 := 1; 159#L12-2 assume !(10 == main_~i~0); 154#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 155#L18-1 [2019-11-16 00:03:46,239 INFO L793 eck$LassoCheckResult]: Loop: 155#L18-1 assume !!(main_~i~0 > 0); 161#L12 assume 1 == main_~i~0;main_~up~0 := 1; 136#L12-2 assume !(10 == main_~i~0); 137#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 155#L18-1 [2019-11-16 00:03:46,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:46,240 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2019-11-16 00:03:46,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:46,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323609145] [2019-11-16 00:03:46,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:46,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:46,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:46,271 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:46,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2019-11-16 00:03:46,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:46,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742633390] [2019-11-16 00:03:46,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:46,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:46,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:46,295 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:46,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:46,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1816490734, now seen corresponding path program 2 times [2019-11-16 00:03:46,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:46,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234463397] [2019-11-16 00:03:46,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:46,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:46,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:46,344 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:03:46,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234463397] [2019-11-16 00:03:46,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:46,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:46,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13424286] [2019-11-16 00:03:46,381 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:46,382 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:46,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:46,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:46,382 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:46,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:46,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:46,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:46,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2019-11-16 00:03:46,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:46,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:46,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:46,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:46,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:03:46,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:46,514 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:46,514 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:46,534 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:46,535 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:03:46,549 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:46,549 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:46,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:46,570 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:46,581 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:46,581 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:46,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:46,597 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:46,603 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:46,603 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:46,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:46,612 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:03:46,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:46,640 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:46,648 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:46,651 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:46,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:46,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:46,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:46,652 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:46,652 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:46,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:46,652 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:46,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2019-11-16 00:03:46,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:46,652 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:46,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:03:46,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:03:46,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:03:46,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:46,760 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:46,760 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:46,761 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:03:46,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:46,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:46,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:46,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:46,765 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:46,765 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:46,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:46,770 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:03:46,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:46,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:46,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:46,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:46,774 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:46,774 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:46,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:46,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:03:46,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:46,785 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:46,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:46,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:46,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:46,787 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:46,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:46,798 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:46,802 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:46,812 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:03:46,813 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:46,813 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:46,813 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:46,814 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 3 Supporting invariants [] [2019-11-16 00:03:46,814 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:46,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:46,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:46,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:46,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:46,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:46,885 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:03:46,886 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:03:46,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-16 00:03:46,950 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 43 states and 64 transitions. Complement of second has 7 states. [2019-11-16 00:03:46,954 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:03:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:03:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-16 00:03:46,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:03:46,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:46,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-16 00:03:46,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:46,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-16 00:03:46,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:46,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 64 transitions. [2019-11-16 00:03:46,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-11-16 00:03:46,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 63 transitions. [2019-11-16 00:03:46,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-16 00:03:46,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-16 00:03:46,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 63 transitions. [2019-11-16 00:03:46,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:46,963 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2019-11-16 00:03:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 63 transitions. [2019-11-16 00:03:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-16 00:03:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:03:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2019-11-16 00:03:46,977 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2019-11-16 00:03:46,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:46,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:46,979 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 4 states. [2019-11-16 00:03:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:47,033 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-11-16 00:03:47,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:47,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 64 transitions. [2019-11-16 00:03:47,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-11-16 00:03:47,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 41 states and 59 transitions. [2019-11-16 00:03:47,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-16 00:03:47,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-16 00:03:47,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 59 transitions. [2019-11-16 00:03:47,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:47,038 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2019-11-16 00:03:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 59 transitions. [2019-11-16 00:03:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-11-16 00:03:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:03:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2019-11-16 00:03:47,047 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-11-16 00:03:47,047 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-11-16 00:03:47,048 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:03:47,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2019-11-16 00:03:47,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-16 00:03:47,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:47,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:47,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:03:47,052 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:47,052 INFO L791 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 348#L18-1 assume !!(main_~i~0 > 0); 352#L12 assume 1 == main_~i~0;main_~up~0 := 1; 343#L12-2 assume !(10 == main_~i~0); 344#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 363#L18-1 [2019-11-16 00:03:47,052 INFO L793 eck$LassoCheckResult]: Loop: 363#L18-1 assume !!(main_~i~0 > 0); 354#L12 assume !(1 == main_~i~0); 355#L12-2 assume !(10 == main_~i~0); 364#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 363#L18-1 [2019-11-16 00:03:47,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 3 times [2019-11-16 00:03:47,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:47,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527622504] [2019-11-16 00:03:47,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:47,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:47,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:47,078 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2019-11-16 00:03:47,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:47,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631993160] [2019-11-16 00:03:47,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:47,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:47,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:47,091 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1816492656, now seen corresponding path program 1 times [2019-11-16 00:03:47,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:47,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569940964] [2019-11-16 00:03:47,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:47,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:47,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:47,116 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:47,147 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:47,147 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:47,147 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:47,147 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:47,148 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:47,148 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,148 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:47,148 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:47,148 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2019-11-16 00:03:47,148 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:47,148 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:47,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,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:03:47,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,287 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:47,287 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:47,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:47,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:47,311 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:47,311 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:47,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:47,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:47,336 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:47,337 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:47,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:47,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:47,349 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:47,349 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:47,365 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:47,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:47,410 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:47,410 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=15} Honda state: {ULTIMATE.start_main_~i~0=15} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~i~0=0}] Lambdas: [1, 9, 11] Nus: [0, 0] [2019-11-16 00:03:47,473 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:47,473 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:47,473 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:47,473 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:47,473 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:47,474 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,474 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:47,474 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:47,474 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2019-11-16 00:03:47,474 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:47,474 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:47,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,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:03:47,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,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:03:47,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,635 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:47,635 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) [2019-11-16 00:03:47,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:47,645 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,650 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:47,650 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:47,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:47,666 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:47,666 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:47,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:47,680 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:47,680 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_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:47,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:47,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:47,689 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:47,689 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_6=0} Honda state: {v_rep~unnamed0~0~false_6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:47,694 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:47,703 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:47,711 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:47,713 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:47,713 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:47,713 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:47,713 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:47,713 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:47,713 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:47,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:47,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:47,713 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2019-11-16 00:03:47,714 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:47,714 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:47,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:47,905 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:47,905 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:47,905 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:03:47,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:47,906 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:47,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:47,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:47,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:47,907 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:47,907 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:47,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:47,908 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:03:47,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:47,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:47,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:47,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:47,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:47,909 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:47,909 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:47,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:47,910 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:03:47,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:47,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:47,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:47,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:47,917 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:47,917 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:47,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:47,936 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:03:47,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:47,937 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:47,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:47,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:47,939 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:47,939 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:47,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:47,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:03:47,954 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:47,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:47,954 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:03:47,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:47,959 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:03:47,959 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:03:48,078 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:48,150 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-16 00:03:48,150 INFO L444 ModelExtractionUtils]: 2 out of 11 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:03:48,151 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:48,160 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-11-16 00:03:48,161 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:48,161 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0 + 10 >= 0] [2019-11-16 00:03:48,164 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-16 00:03:48,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:48,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:48,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:48,233 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:03:48,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:48,250 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:03:48,251 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-16 00:03:48,251 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-16 00:03:48,353 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 38 states and 55 transitions. Complement of second has 8 states. [2019-11-16 00:03:48,354 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:03:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:03:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-16 00:03:48,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:03:48,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:48,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-16 00:03:48,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:48,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-16 00:03:48,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:48,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. [2019-11-16 00:03:48,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-16 00:03:48,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 54 transitions. [2019-11-16 00:03:48,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-16 00:03:48,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-16 00:03:48,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 54 transitions. [2019-11-16 00:03:48,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:48,358 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 54 transitions. [2019-11-16 00:03:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 54 transitions. [2019-11-16 00:03:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-16 00:03:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-16 00:03:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-11-16 00:03:48,361 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-11-16 00:03:48,361 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-11-16 00:03:48,361 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:03:48,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 53 transitions. [2019-11-16 00:03:48,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-16 00:03:48,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:48,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:48,363 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:48,363 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:48,363 INFO L791 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 477#L18-1 assume !!(main_~i~0 > 0); 481#L12 assume 1 == main_~i~0;main_~up~0 := 1; 493#L12-2 assume !(10 == main_~i~0); 492#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 491#L18-1 assume !!(main_~i~0 > 0); 483#L12 assume !(1 == main_~i~0); 484#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 473#L15-1 [2019-11-16 00:03:48,363 INFO L793 eck$LassoCheckResult]: Loop: 473#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 478#L18-1 assume !!(main_~i~0 > 0); 479#L12 assume !(1 == main_~i~0); 472#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 473#L15-1 [2019-11-16 00:03:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 612785863, now seen corresponding path program 1 times [2019-11-16 00:03:48,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:48,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414154185] [2019-11-16 00:03:48,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:48,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:48,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:48,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414154185] [2019-11-16 00:03:48,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646272145] [2019-11-16 00:03:48,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:48,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:03:48,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:48,468 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:48,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-16 00:03:48,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188517196] [2019-11-16 00:03:48,471 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1737972, now seen corresponding path program 2 times [2019-11-16 00:03:48,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:48,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519815635] [2019-11-16 00:03:48,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:48,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:48,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:48,488 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:48,562 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:48,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:48,562 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:48,562 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:48,562 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:48,562 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:48,563 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:48,563 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:48,563 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2019-11-16 00:03:48,563 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:48,563 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:48,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:48,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:03:48,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:48,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:48,637 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:48,638 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) [2019-11-16 00:03:48,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:48,649 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:48,654 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:48,655 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) [2019-11-16 00:03:48,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:48,661 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:48,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:48,665 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_8=1} Honda state: {v_rep~unnamed0~0~true_8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) [2019-11-16 00:03:48,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:48,673 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:03:48,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:48,685 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:48,788 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:48,790 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:48,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:48,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:48,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:48,790 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:48,790 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:48,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:48,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:48,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2019-11-16 00:03:48,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:48,791 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:48,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:48,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:48,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:48,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:48,875 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:48,876 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:48,876 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:03:48,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:48,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:48,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:48,877 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:03:48,877 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:48,877 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:03:48,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:48,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:48,888 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:03:48,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:48,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:48,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:48,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:48,891 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:48,891 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:48,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:48,894 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:03:48,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:48,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:48,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:48,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:48,897 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:48,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:48,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:48,900 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:03:48,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:48,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:48,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:48,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:48,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:48,903 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:48,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:48,907 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:48,912 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:48,913 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:48,913 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:48,913 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:48,913 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:48,914 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:48,914 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:48,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:48,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:48,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:48,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:48,979 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:03:48,979 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:03:48,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-11-16 00:03:49,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 91 states and 135 transitions. Complement of second has 7 states. [2019-11-16 00:03:49,017 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:03:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:03:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-16 00:03:49,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-16 00:03:49,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:49,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-16 00:03:49,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:49,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-16 00:03:49,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:49,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 135 transitions. [2019-11-16 00:03:49,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2019-11-16 00:03:49,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 115 transitions. [2019-11-16 00:03:49,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-11-16 00:03:49,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-16 00:03:49,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 115 transitions. [2019-11-16 00:03:49,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:49,023 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 115 transitions. [2019-11-16 00:03:49,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 115 transitions. [2019-11-16 00:03:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-11-16 00:03:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-16 00:03:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2019-11-16 00:03:49,031 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 114 transitions. [2019-11-16 00:03:49,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:49,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:49,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:49,032 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand 4 states. [2019-11-16 00:03:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:49,060 INFO L93 Difference]: Finished difference Result 105 states and 148 transitions. [2019-11-16 00:03:49,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:49,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 148 transitions. [2019-11-16 00:03:49,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-11-16 00:03:49,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 148 transitions. [2019-11-16 00:03:49,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2019-11-16 00:03:49,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2019-11-16 00:03:49,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 148 transitions. [2019-11-16 00:03:49,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:49,066 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 148 transitions. [2019-11-16 00:03:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 148 transitions. [2019-11-16 00:03:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2019-11-16 00:03:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-16 00:03:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2019-11-16 00:03:49,072 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 130 transitions. [2019-11-16 00:03:49,073 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 130 transitions. [2019-11-16 00:03:49,073 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:03:49,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 130 transitions. [2019-11-16 00:03:49,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2019-11-16 00:03:49,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:49,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:49,075 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-16 00:03:49,075 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:49,076 INFO L791 eck$LassoCheckResult]: Stem: 867#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 868#L18-1 assume !!(main_~i~0 > 0); 905#L12 assume 1 == main_~i~0;main_~up~0 := 1; 904#L12-2 assume !(10 == main_~i~0); 903#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 901#L18-1 assume !!(main_~i~0 > 0); 902#L12 assume !(1 == main_~i~0); 914#L12-2 assume !(10 == main_~i~0); 912#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 890#L18-1 [2019-11-16 00:03:49,076 INFO L793 eck$LassoCheckResult]: Loop: 890#L18-1 assume !!(main_~i~0 > 0); 908#L12 assume 1 == main_~i~0;main_~up~0 := 1; 899#L12-2 assume !(10 == main_~i~0); 897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 890#L18-1 [2019-11-16 00:03:49,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1816492658, now seen corresponding path program 1 times [2019-11-16 00:03:49,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720081100] [2019-11-16 00:03:49,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:03:49,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720081100] [2019-11-16 00:03:49,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:49,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:49,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653449601] [2019-11-16 00:03:49,091 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2019-11-16 00:03:49,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427458544] [2019-11-16 00:03:49,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,098 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:03:49,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427458544] [2019-11-16 00:03:49,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:49,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:49,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891968033] [2019-11-16 00:03:49,099 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:49,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:49,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:49,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:49,100 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. cyclomatic complexity: 49 Second operand 3 states. [2019-11-16 00:03:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:49,108 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-11-16 00:03:49,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:49,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2019-11-16 00:03:49,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-16 00:03:49,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 51 states and 63 transitions. [2019-11-16 00:03:49,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-16 00:03:49,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-16 00:03:49,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2019-11-16 00:03:49,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:49,111 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-16 00:03:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2019-11-16 00:03:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-16 00:03:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-16 00:03:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-11-16 00:03:49,114 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-16 00:03:49,114 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-16 00:03:49,114 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:03:49,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 60 transitions. [2019-11-16 00:03:49,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-16 00:03:49,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:49,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:49,116 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2019-11-16 00:03:49,116 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2019-11-16 00:03:49,116 INFO L791 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1031#L18-1 assume !!(main_~i~0 > 0); 1061#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1059#L12-2 assume !(10 == main_~i~0); 1057#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1055#L18-1 assume !!(main_~i~0 > 0); 1048#L12 assume !(1 == main_~i~0); 1051#L12-2 assume !(10 == main_~i~0); 1049#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1047#L18-1 assume !!(main_~i~0 > 0); 1046#L12 assume !(1 == main_~i~0); 1045#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1044#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1034#L18-1 assume !!(main_~i~0 > 0); 1035#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1026#L12-2 [2019-11-16 00:03:49,116 INFO L793 eck$LassoCheckResult]: Loop: 1026#L12-2 assume !(10 == main_~i~0); 1027#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1068#L18-1 assume !!(main_~i~0 > 0); 1036#L12 assume !(1 == main_~i~0); 1037#L12-2 assume !(10 == main_~i~0); 1073#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1032#L18-1 assume !!(main_~i~0 > 0); 1033#L12 assume !(1 == main_~i~0); 1072#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1040#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1041#L18-1 assume !!(main_~i~0 > 0); 1071#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1026#L12-2 [2019-11-16 00:03:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1399375584, now seen corresponding path program 1 times [2019-11-16 00:03:49,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142008289] [2019-11-16 00:03:49,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:03:49,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142008289] [2019-11-16 00:03:49,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:49,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:49,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244608484] [2019-11-16 00:03:49,134 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:49,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash 388845694, now seen corresponding path program 1 times [2019-11-16 00:03:49,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932708478] [2019-11-16 00:03:49,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:49,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932708478] [2019-11-16 00:03:49,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:49,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:49,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496436055] [2019-11-16 00:03:49,149 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:49,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:49,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:49,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:49,150 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-16 00:03:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:49,177 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2019-11-16 00:03:49,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:49,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 79 transitions. [2019-11-16 00:03:49,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-16 00:03:49,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 78 transitions. [2019-11-16 00:03:49,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-16 00:03:49,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-16 00:03:49,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 78 transitions. [2019-11-16 00:03:49,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:49,180 INFO L688 BuchiCegarLoop]: Abstraction has 63 states and 78 transitions. [2019-11-16 00:03:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 78 transitions. [2019-11-16 00:03:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2019-11-16 00:03:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-16 00:03:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2019-11-16 00:03:49,183 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-11-16 00:03:49,183 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-11-16 00:03:49,183 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:03:49,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 68 transitions. [2019-11-16 00:03:49,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-16 00:03:49,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:49,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:49,185 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 3, 2, 2, 2, 1, 1] [2019-11-16 00:03:49,185 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2019-11-16 00:03:49,185 INFO L791 eck$LassoCheckResult]: Stem: 1152#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1153#L18-1 assume !!(main_~i~0 > 0); 1182#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1180#L12-2 assume !(10 == main_~i~0); 1178#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1176#L18-1 assume !!(main_~i~0 > 0); 1169#L12 assume !(1 == main_~i~0); 1172#L12-2 assume !(10 == main_~i~0); 1170#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1168#L18-1 assume !!(main_~i~0 > 0); 1167#L12 assume !(1 == main_~i~0); 1166#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1160#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1161#L18-1 assume !!(main_~i~0 > 0); 1159#L12 assume !(1 == main_~i~0); 1149#L12-2 assume !(10 == main_~i~0); 1151#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1156#L18-1 assume !!(main_~i~0 > 0); 1157#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1191#L12-2 [2019-11-16 00:03:49,185 INFO L793 eck$LassoCheckResult]: Loop: 1191#L12-2 assume !(10 == main_~i~0); 1162#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1154#L18-1 assume !!(main_~i~0 > 0); 1155#L12 assume !(1 == main_~i~0); 1158#L12-2 assume !(10 == main_~i~0); 1197#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1200#L18-1 assume !!(main_~i~0 > 0); 1199#L12 assume !(1 == main_~i~0); 1196#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1148#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1163#L18-1 assume !!(main_~i~0 > 0); 1194#L12 assume !(1 == main_~i~0); 1195#L12-2 assume !(10 == main_~i~0); 1198#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1202#L18-1 assume !!(main_~i~0 > 0); 1201#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1191#L12-2 [2019-11-16 00:03:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1376811083, now seen corresponding path program 2 times [2019-11-16 00:03:49,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454843081] [2019-11-16 00:03:49,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:49,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454843081] [2019-11-16 00:03:49,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783541562] [2019-11-16 00:03:49,244 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:49,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:03:49,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:49,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:49,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:03:49,294 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:49,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-11-16 00:03:49,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709879348] [2019-11-16 00:03:49,295 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:49,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash 656081641, now seen corresponding path program 2 times [2019-11-16 00:03:49,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940283577] [2019-11-16 00:03:49,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:49,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940283577] [2019-11-16 00:03:49,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145626445] [2019-11-16 00:03:49,327 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:49,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:03:49,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:49,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:49,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:49,372 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:49,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:03:49,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990069999] [2019-11-16 00:03:49,373 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:49,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:49,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:49,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:49,373 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-16 00:03:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:49,410 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2019-11-16 00:03:49,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:49,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 94 transitions. [2019-11-16 00:03:49,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-11-16 00:03:49,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 93 transitions. [2019-11-16 00:03:49,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-16 00:03:49,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-16 00:03:49,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 93 transitions. [2019-11-16 00:03:49,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:49,413 INFO L688 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2019-11-16 00:03:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 93 transitions. [2019-11-16 00:03:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2019-11-16 00:03:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-16 00:03:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2019-11-16 00:03:49,416 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-11-16 00:03:49,417 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-11-16 00:03:49,417 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:03:49,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 83 transitions. [2019-11-16 00:03:49,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-16 00:03:49,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:49,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:49,418 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 4, 3, 2, 2, 1, 1] [2019-11-16 00:03:49,418 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2019-11-16 00:03:49,419 INFO L791 eck$LassoCheckResult]: Stem: 1397#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1398#L18-1 assume !!(main_~i~0 > 0); 1422#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1421#L12-2 assume !(10 == main_~i~0); 1420#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1419#L18-1 assume !!(main_~i~0 > 0); 1416#L12 assume !(1 == main_~i~0); 1418#L12-2 assume !(10 == main_~i~0); 1417#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1415#L18-1 assume !!(main_~i~0 > 0); 1414#L12 assume !(1 == main_~i~0); 1413#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1406#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1407#L18-1 assume !!(main_~i~0 > 0); 1457#L12 assume !(1 == main_~i~0); 1456#L12-2 assume !(10 == main_~i~0); 1455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1454#L18-1 assume !!(main_~i~0 > 0); 1453#L12 assume !(1 == main_~i~0); 1433#L12-2 assume !(10 == main_~i~0); 1439#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1438#L18-1 assume !!(main_~i~0 > 0); 1432#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1431#L12-2 [2019-11-16 00:03:49,419 INFO L793 eck$LassoCheckResult]: Loop: 1431#L12-2 assume !(10 == main_~i~0); 1443#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1440#L18-1 assume !!(main_~i~0 > 0); 1434#L12 assume !(1 == main_~i~0); 1435#L12-2 assume !(10 == main_~i~0); 1428#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1437#L18-1 assume !!(main_~i~0 > 0); 1430#L12 assume !(1 == main_~i~0); 1427#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1393#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1449#L18-1 assume !!(main_~i~0 > 0); 1450#L12 assume !(1 == main_~i~0); 1451#L12-2 assume !(10 == main_~i~0); 1410#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1411#L18-1 assume !!(main_~i~0 > 0); 1403#L12 assume !(1 == main_~i~0); 1404#L12-2 assume !(10 == main_~i~0); 1429#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1399#L18-1 assume !!(main_~i~0 > 0); 1400#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1431#L12-2 [2019-11-16 00:03:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1767603254, now seen corresponding path program 3 times [2019-11-16 00:03:49,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676776638] [2019-11-16 00:03:49,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:49,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676776638] [2019-11-16 00:03:49,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595455719] [2019-11-16 00:03:49,474 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:49,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-16 00:03:49,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:49,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:03:49,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:03:49,633 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:49,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2019-11-16 00:03:49,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087845800] [2019-11-16 00:03:49,634 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:49,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1254328276, now seen corresponding path program 3 times [2019-11-16 00:03:49,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692468163] [2019-11-16 00:03:49,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:49,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692468163] [2019-11-16 00:03:49,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247968115] [2019-11-16 00:03:49,671 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:49,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:03:49,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:49,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:03:49,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:49,726 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:49,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-16 00:03:49,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068813835] [2019-11-16 00:03:49,727 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:49,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:49,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:49,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:49,728 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. cyclomatic complexity: 21 Second operand 6 states. [2019-11-16 00:03:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:49,775 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2019-11-16 00:03:49,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:49,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 109 transitions. [2019-11-16 00:03:49,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2019-11-16 00:03:49,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 108 transitions. [2019-11-16 00:03:49,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-16 00:03:49,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-16 00:03:49,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 108 transitions. [2019-11-16 00:03:49,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:49,778 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-11-16 00:03:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 108 transitions. [2019-11-16 00:03:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2019-11-16 00:03:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-16 00:03:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2019-11-16 00:03:49,785 INFO L711 BuchiCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-11-16 00:03:49,785 INFO L591 BuchiCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-11-16 00:03:49,785 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:03:49,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 98 transitions. [2019-11-16 00:03:49,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-16 00:03:49,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:49,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:49,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1] [2019-11-16 00:03:49,788 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2019-11-16 00:03:49,788 INFO L791 eck$LassoCheckResult]: Stem: 1696#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1697#L18-1 assume !!(main_~i~0 > 0); 1720#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1719#L12-2 assume !(10 == main_~i~0); 1718#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1717#L18-1 assume !!(main_~i~0 > 0); 1714#L12 assume !(1 == main_~i~0); 1716#L12-2 assume !(10 == main_~i~0); 1715#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1713#L18-1 assume !!(main_~i~0 > 0); 1712#L12 assume !(1 == main_~i~0); 1711#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1704#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1705#L18-1 assume !!(main_~i~0 > 0); 1751#L12 assume !(1 == main_~i~0); 1750#L12-2 assume !(10 == main_~i~0); 1749#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1748#L18-1 assume !!(main_~i~0 > 0); 1747#L12 assume !(1 == main_~i~0); 1746#L12-2 assume !(10 == main_~i~0); 1745#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1744#L18-1 assume !!(main_~i~0 > 0); 1743#L12 assume !(1 == main_~i~0); 1728#L12-2 assume !(10 == main_~i~0); 1732#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1731#L18-1 assume !!(main_~i~0 > 0); 1727#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1709#L12-2 [2019-11-16 00:03:49,788 INFO L793 eck$LassoCheckResult]: Loop: 1709#L12-2 assume !(10 == main_~i~0); 1710#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1762#L18-1 assume !!(main_~i~0 > 0); 1729#L12 assume !(1 == main_~i~0); 1730#L12-2 assume !(10 == main_~i~0); 1741#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1738#L18-1 assume !!(main_~i~0 > 0); 1739#L12 assume !(1 == main_~i~0); 1759#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1692#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1708#L18-1 assume !!(main_~i~0 > 0); 1761#L12 assume !(1 == main_~i~0); 1760#L12-2 assume !(10 == main_~i~0); 1758#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1757#L18-1 assume !!(main_~i~0 > 0); 1756#L12 assume !(1 == main_~i~0); 1755#L12-2 assume !(10 == main_~i~0); 1754#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1753#L18-1 assume !!(main_~i~0 > 0); 1752#L12 assume !(1 == main_~i~0); 1726#L12-2 assume !(10 == main_~i~0); 1736#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1733#L18-1 assume !!(main_~i~0 > 0); 1725#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1709#L12-2 [2019-11-16 00:03:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash 442274465, now seen corresponding path program 4 times [2019-11-16 00:03:49,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856510812] [2019-11-16 00:03:49,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:49,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856510812] [2019-11-16 00:03:49,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572917143] [2019-11-16 00:03:49,846 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:49,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:03:49,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:49,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:49,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:03:49,904 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:49,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2019-11-16 00:03:49,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574484704] [2019-11-16 00:03:49,905 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1418092737, now seen corresponding path program 4 times [2019-11-16 00:03:49,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:49,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703729694] [2019-11-16 00:03:49,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:49,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:49,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703729694] [2019-11-16 00:03:49,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726828054] [2019-11-16 00:03:49,953 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:49,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:03:49,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:49,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:03:49,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:49,997 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:49,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-16 00:03:49,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519568397] [2019-11-16 00:03:49,998 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:49,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:49,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:49,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:49,999 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. cyclomatic complexity: 24 Second operand 7 states. [2019-11-16 00:03:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:50,067 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2019-11-16 00:03:50,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:50,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 124 transitions. [2019-11-16 00:03:50,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-16 00:03:50,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 99 states and 123 transitions. [2019-11-16 00:03:50,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-16 00:03:50,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-16 00:03:50,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 123 transitions. [2019-11-16 00:03:50,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:50,070 INFO L688 BuchiCegarLoop]: Abstraction has 99 states and 123 transitions. [2019-11-16 00:03:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 123 transitions. [2019-11-16 00:03:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-11-16 00:03:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-16 00:03:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2019-11-16 00:03:50,073 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 113 transitions. [2019-11-16 00:03:50,073 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 113 transitions. [2019-11-16 00:03:50,074 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:03:50,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 113 transitions. [2019-11-16 00:03:50,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-11-16 00:03:50,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:50,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:50,076 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 6, 6, 5, 2, 2, 1, 1] [2019-11-16 00:03:50,076 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2019-11-16 00:03:50,083 INFO L791 eck$LassoCheckResult]: Stem: 2041#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2042#L18-1 assume !!(main_~i~0 > 0); 2063#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2062#L12-2 assume !(10 == main_~i~0); 2061#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2060#L18-1 assume !!(main_~i~0 > 0); 2057#L12 assume !(1 == main_~i~0); 2059#L12-2 assume !(10 == main_~i~0); 2058#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2056#L18-1 assume !!(main_~i~0 > 0); 2055#L12 assume !(1 == main_~i~0); 2054#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2048#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2049#L18-1 assume !!(main_~i~0 > 0); 2098#L12 assume !(1 == main_~i~0); 2097#L12-2 assume !(10 == main_~i~0); 2096#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2095#L18-1 assume !!(main_~i~0 > 0); 2094#L12 assume !(1 == main_~i~0); 2093#L12-2 assume !(10 == main_~i~0); 2092#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2091#L18-1 assume !!(main_~i~0 > 0); 2090#L12 assume !(1 == main_~i~0); 2089#L12-2 assume !(10 == main_~i~0); 2088#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2087#L18-1 assume !!(main_~i~0 > 0); 2086#L12 assume !(1 == main_~i~0); 2072#L12-2 assume !(10 == main_~i~0); 2075#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2074#L18-1 assume !!(main_~i~0 > 0); 2071#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2069#L12-2 [2019-11-16 00:03:50,084 INFO L793 eck$LassoCheckResult]: Loop: 2069#L12-2 assume !(10 == main_~i~0); 2084#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2082#L18-1 assume !!(main_~i~0 > 0); 2073#L12 assume !(1 == main_~i~0); 2052#L12-2 assume !(10 == main_~i~0); 2053#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2115#L18-1 assume !!(main_~i~0 > 0); 2113#L12 assume !(1 == main_~i~0); 2111#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2037#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2051#L18-1 assume !!(main_~i~0 > 0); 2114#L12 assume !(1 == main_~i~0); 2112#L12-2 assume !(10 == main_~i~0); 2110#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2109#L18-1 assume !!(main_~i~0 > 0); 2108#L12 assume !(1 == main_~i~0); 2107#L12-2 assume !(10 == main_~i~0); 2106#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2105#L18-1 assume !!(main_~i~0 > 0); 2104#L12 assume !(1 == main_~i~0); 2103#L12-2 assume !(10 == main_~i~0); 2102#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2101#L18-1 assume !!(main_~i~0 > 0); 2100#L12 assume !(1 == main_~i~0); 2070#L12-2 assume !(10 == main_~i~0); 2080#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2076#L18-1 assume !!(main_~i~0 > 0); 2068#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2069#L12-2 [2019-11-16 00:03:50,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:50,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1631159412, now seen corresponding path program 5 times [2019-11-16 00:03:50,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:50,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114670151] [2019-11-16 00:03:50,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:50,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114670151] [2019-11-16 00:03:50,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200064813] [2019-11-16 00:03:50,206 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:50,265 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-16 00:03:50,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:50,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:50,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-16 00:03:50,282 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:50,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2019-11-16 00:03:50,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200262830] [2019-11-16 00:03:50,283 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:50,284 INFO L82 PathProgramCache]: Analyzing trace with hash 187697450, now seen corresponding path program 5 times [2019-11-16 00:03:50,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:50,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729873105] [2019-11-16 00:03:50,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:50,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729873105] [2019-11-16 00:03:50,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731930973] [2019-11-16 00:03:50,370 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:50,411 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-16 00:03:50,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:50,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:03:50,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:50,421 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:50,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-16 00:03:50,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871886615] [2019-11-16 00:03:50,421 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:50,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:50,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:03:50,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:50,422 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. cyclomatic complexity: 27 Second operand 8 states. [2019-11-16 00:03:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:50,476 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2019-11-16 00:03:50,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:03:50,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 139 transitions. [2019-11-16 00:03:50,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2019-11-16 00:03:50,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 111 states and 138 transitions. [2019-11-16 00:03:50,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-11-16 00:03:50,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2019-11-16 00:03:50,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 138 transitions. [2019-11-16 00:03:50,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:50,493 INFO L688 BuchiCegarLoop]: Abstraction has 111 states and 138 transitions. [2019-11-16 00:03:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 138 transitions. [2019-11-16 00:03:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2019-11-16 00:03:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-16 00:03:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2019-11-16 00:03:50,496 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 128 transitions. [2019-11-16 00:03:50,496 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 128 transitions. [2019-11-16 00:03:50,496 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-16 00:03:50,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 128 transitions. [2019-11-16 00:03:50,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-11-16 00:03:50,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:50,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:50,498 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 7, 7, 6, 2, 2, 1, 1] [2019-11-16 00:03:50,498 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2019-11-16 00:03:50,499 INFO L791 eck$LassoCheckResult]: Stem: 2436#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2437#L18-1 assume !!(main_~i~0 > 0); 2460#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2459#L12-2 assume !(10 == main_~i~0); 2458#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2457#L18-1 assume !!(main_~i~0 > 0); 2454#L12 assume !(1 == main_~i~0); 2456#L12-2 assume !(10 == main_~i~0); 2455#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2453#L18-1 assume !!(main_~i~0 > 0); 2452#L12 assume !(1 == main_~i~0); 2451#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2445#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2446#L18-1 assume !!(main_~i~0 > 0); 2500#L12 assume !(1 == main_~i~0); 2499#L12-2 assume !(10 == main_~i~0); 2498#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2497#L18-1 assume !!(main_~i~0 > 0); 2496#L12 assume !(1 == main_~i~0); 2495#L12-2 assume !(10 == main_~i~0); 2494#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2493#L18-1 assume !!(main_~i~0 > 0); 2492#L12 assume !(1 == main_~i~0); 2491#L12-2 assume !(10 == main_~i~0); 2490#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2489#L18-1 assume !!(main_~i~0 > 0); 2488#L12 assume !(1 == main_~i~0); 2487#L12-2 assume !(10 == main_~i~0); 2486#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2485#L18-1 assume !!(main_~i~0 > 0); 2484#L12 assume !(1 == main_~i~0); 2468#L12-2 assume !(10 == main_~i~0); 2472#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2471#L18-1 assume !!(main_~i~0 > 0); 2467#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2449#L12-2 [2019-11-16 00:03:50,499 INFO L793 eck$LassoCheckResult]: Loop: 2449#L12-2 assume !(10 == main_~i~0); 2450#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2479#L18-1 assume !!(main_~i~0 > 0); 2469#L12 assume !(1 == main_~i~0); 2470#L12-2 assume !(10 == main_~i~0); 2481#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2482#L18-1 assume !!(main_~i~0 > 0); 2525#L12 assume !(1 == main_~i~0); 2523#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2432#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2448#L18-1 assume !!(main_~i~0 > 0); 2442#L12 assume !(1 == main_~i~0); 2443#L12-2 assume !(10 == main_~i~0); 2516#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2515#L18-1 assume !!(main_~i~0 > 0); 2514#L12 assume !(1 == main_~i~0); 2513#L12-2 assume !(10 == main_~i~0); 2512#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2511#L18-1 assume !!(main_~i~0 > 0); 2510#L12 assume !(1 == main_~i~0); 2509#L12-2 assume !(10 == main_~i~0); 2508#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2507#L18-1 assume !!(main_~i~0 > 0); 2506#L12 assume !(1 == main_~i~0); 2505#L12-2 assume !(10 == main_~i~0); 2504#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2503#L18-1 assume !!(main_~i~0 > 0); 2502#L12 assume !(1 == main_~i~0); 2466#L12-2 assume !(10 == main_~i~0); 2478#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2476#L18-1 assume !!(main_~i~0 > 0); 2465#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2449#L12-2 [2019-11-16 00:03:50,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1729366281, now seen corresponding path program 6 times [2019-11-16 00:03:50,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:50,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804989268] [2019-11-16 00:03:50,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:50,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804989268] [2019-11-16 00:03:50,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99817245] [2019-11-16 00:03:50,594 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:50,632 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-16 00:03:50,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:50,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:03:50,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 63 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:03:50,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:50,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2019-11-16 00:03:50,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140744491] [2019-11-16 00:03:50,729 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:50,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:50,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1954121109, now seen corresponding path program 6 times [2019-11-16 00:03:50,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:50,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644180013] [2019-11-16 00:03:50,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:50,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644180013] [2019-11-16 00:03:50,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489108121] [2019-11-16 00:03:50,791 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:50,833 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-16 00:03:50,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:50,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:03:50,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:50,840 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:50,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-16 00:03:50,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003975733] [2019-11-16 00:03:50,841 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:50,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:50,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:03:50,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:03:50,842 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. cyclomatic complexity: 30 Second operand 9 states. [2019-11-16 00:03:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:50,926 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2019-11-16 00:03:50,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:03:50,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 154 transitions. [2019-11-16 00:03:50,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-16 00:03:50,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 123 states and 153 transitions. [2019-11-16 00:03:50,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-16 00:03:50,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-11-16 00:03:50,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 153 transitions. [2019-11-16 00:03:50,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:50,929 INFO L688 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. [2019-11-16 00:03:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 153 transitions. [2019-11-16 00:03:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2019-11-16 00:03:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-16 00:03:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-11-16 00:03:50,932 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-11-16 00:03:50,933 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-11-16 00:03:50,933 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-16 00:03:50,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 143 transitions. [2019-11-16 00:03:50,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2019-11-16 00:03:50,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:50,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:50,935 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 8, 8, 7, 2, 2, 1, 1] [2019-11-16 00:03:50,935 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2019-11-16 00:03:50,935 INFO L791 eck$LassoCheckResult]: Stem: 2888#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2889#L18-1 assume !!(main_~i~0 > 0); 2912#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2911#L12-2 assume !(10 == main_~i~0); 2910#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2909#L18-1 assume !!(main_~i~0 > 0); 2906#L12 assume !(1 == main_~i~0); 2908#L12-2 assume !(10 == main_~i~0); 2907#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2905#L18-1 assume !!(main_~i~0 > 0); 2904#L12 assume !(1 == main_~i~0); 2903#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2898#L18-1 assume !!(main_~i~0 > 0); 2956#L12 assume !(1 == main_~i~0); 2955#L12-2 assume !(10 == main_~i~0); 2954#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2953#L18-1 assume !!(main_~i~0 > 0); 2952#L12 assume !(1 == main_~i~0); 2951#L12-2 assume !(10 == main_~i~0); 2950#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2949#L18-1 assume !!(main_~i~0 > 0); 2948#L12 assume !(1 == main_~i~0); 2947#L12-2 assume !(10 == main_~i~0); 2946#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2945#L18-1 assume !!(main_~i~0 > 0); 2944#L12 assume !(1 == main_~i~0); 2943#L12-2 assume !(10 == main_~i~0); 2942#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2941#L18-1 assume !!(main_~i~0 > 0); 2940#L12 assume !(1 == main_~i~0); 2939#L12-2 assume !(10 == main_~i~0); 2938#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2937#L18-1 assume !!(main_~i~0 > 0); 2936#L12 assume !(1 == main_~i~0); 2920#L12-2 assume !(10 == main_~i~0); 2924#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2923#L18-1 assume !!(main_~i~0 > 0); 2919#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2901#L12-2 [2019-11-16 00:03:50,936 INFO L793 eck$LassoCheckResult]: Loop: 2901#L12-2 assume !(10 == main_~i~0); 2902#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2931#L18-1 assume !!(main_~i~0 > 0); 2921#L12 assume !(1 == main_~i~0); 2922#L12-2 assume !(10 == main_~i~0); 2933#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2934#L18-1 assume !!(main_~i~0 > 0); 2985#L12 assume !(1 == main_~i~0); 2983#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2884#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2900#L18-1 assume !!(main_~i~0 > 0); 2894#L12 assume !(1 == main_~i~0); 2895#L12-2 assume !(10 == main_~i~0); 2976#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2975#L18-1 assume !!(main_~i~0 > 0); 2974#L12 assume !(1 == main_~i~0); 2973#L12-2 assume !(10 == main_~i~0); 2972#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2971#L18-1 assume !!(main_~i~0 > 0); 2970#L12 assume !(1 == main_~i~0); 2969#L12-2 assume !(10 == main_~i~0); 2968#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2967#L18-1 assume !!(main_~i~0 > 0); 2966#L12 assume !(1 == main_~i~0); 2965#L12-2 assume !(10 == main_~i~0); 2964#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2963#L18-1 assume !!(main_~i~0 > 0); 2962#L12 assume !(1 == main_~i~0); 2961#L12-2 assume !(10 == main_~i~0); 2960#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2959#L18-1 assume !!(main_~i~0 > 0); 2958#L12 assume !(1 == main_~i~0); 2918#L12-2 assume !(10 == main_~i~0); 2930#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2928#L18-1 assume !!(main_~i~0 > 0); 2917#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2901#L12-2 [2019-11-16 00:03:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1010842398, now seen corresponding path program 7 times [2019-11-16 00:03:50,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:50,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686955934] [2019-11-16 00:03:50,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:50,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:51,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686955934] [2019-11-16 00:03:51,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167418084] [2019-11-16 00:03:51,038 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:51,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:51,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-16 00:03:51,096 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:51,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-11-16 00:03:51,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436825168] [2019-11-16 00:03:51,097 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash -360131456, now seen corresponding path program 7 times [2019-11-16 00:03:51,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:51,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714310873] [2019-11-16 00:03:51,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:51,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714310873] [2019-11-16 00:03:51,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844713648] [2019-11-16 00:03:51,179 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:51,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:03:51,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:51,250 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:51,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-16 00:03:51,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023843260] [2019-11-16 00:03:51,251 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:51,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:03:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:03:51,252 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. cyclomatic complexity: 33 Second operand 10 states. [2019-11-16 00:03:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:51,326 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2019-11-16 00:03:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:03:51,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 169 transitions. [2019-11-16 00:03:51,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-11-16 00:03:51,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 135 states and 168 transitions. [2019-11-16 00:03:51,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-11-16 00:03:51,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2019-11-16 00:03:51,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 168 transitions. [2019-11-16 00:03:51,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:51,329 INFO L688 BuchiCegarLoop]: Abstraction has 135 states and 168 transitions. [2019-11-16 00:03:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 168 transitions. [2019-11-16 00:03:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2019-11-16 00:03:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-16 00:03:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2019-11-16 00:03:51,332 INFO L711 BuchiCegarLoop]: Abstraction has 128 states and 158 transitions. [2019-11-16 00:03:51,332 INFO L591 BuchiCegarLoop]: Abstraction has 128 states and 158 transitions. [2019-11-16 00:03:51,332 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-16 00:03:51,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 158 transitions. [2019-11-16 00:03:51,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2019-11-16 00:03:51,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:51,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:51,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 9, 8, 2, 2, 1, 1] [2019-11-16 00:03:51,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2019-11-16 00:03:51,343 INFO L791 eck$LassoCheckResult]: Stem: 3383#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3384#L18-1 assume !!(main_~i~0 > 0); 3405#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3404#L12-2 assume !(10 == main_~i~0); 3403#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3402#L18-1 assume !!(main_~i~0 > 0); 3399#L12 assume !(1 == main_~i~0); 3401#L12-2 assume !(10 == main_~i~0); 3400#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3398#L18-1 assume !!(main_~i~0 > 0); 3397#L12 assume !(1 == main_~i~0); 3396#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3390#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3391#L18-1 assume !!(main_~i~0 > 0); 3452#L12 assume !(1 == main_~i~0); 3451#L12-2 assume !(10 == main_~i~0); 3450#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3449#L18-1 assume !!(main_~i~0 > 0); 3448#L12 assume !(1 == main_~i~0); 3447#L12-2 assume !(10 == main_~i~0); 3446#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3445#L18-1 assume !!(main_~i~0 > 0); 3444#L12 assume !(1 == main_~i~0); 3443#L12-2 assume !(10 == main_~i~0); 3442#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3441#L18-1 assume !!(main_~i~0 > 0); 3440#L12 assume !(1 == main_~i~0); 3439#L12-2 assume !(10 == main_~i~0); 3438#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3437#L18-1 assume !!(main_~i~0 > 0); 3436#L12 assume !(1 == main_~i~0); 3435#L12-2 assume !(10 == main_~i~0); 3434#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3433#L18-1 assume !!(main_~i~0 > 0); 3432#L12 assume !(1 == main_~i~0); 3431#L12-2 assume !(10 == main_~i~0); 3430#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3429#L18-1 assume !!(main_~i~0 > 0); 3428#L12 assume !(1 == main_~i~0); 3414#L12-2 assume !(10 == main_~i~0); 3417#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3416#L18-1 assume !!(main_~i~0 > 0); 3413#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3411#L12-2 [2019-11-16 00:03:51,343 INFO L793 eck$LassoCheckResult]: Loop: 3411#L12-2 assume !(10 == main_~i~0); 3426#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3424#L18-1 assume !!(main_~i~0 > 0); 3415#L12 assume !(1 == main_~i~0); 3394#L12-2 assume !(10 == main_~i~0); 3395#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3481#L18-1 assume !!(main_~i~0 > 0); 3479#L12 assume !(1 == main_~i~0); 3477#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3379#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3393#L18-1 assume !!(main_~i~0 > 0); 3480#L12 assume !(1 == main_~i~0); 3478#L12-2 assume !(10 == main_~i~0); 3476#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3475#L18-1 assume !!(main_~i~0 > 0); 3474#L12 assume !(1 == main_~i~0); 3473#L12-2 assume !(10 == main_~i~0); 3472#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3471#L18-1 assume !!(main_~i~0 > 0); 3470#L12 assume !(1 == main_~i~0); 3469#L12-2 assume !(10 == main_~i~0); 3468#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3467#L18-1 assume !!(main_~i~0 > 0); 3466#L12 assume !(1 == main_~i~0); 3465#L12-2 assume !(10 == main_~i~0); 3464#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3463#L18-1 assume !!(main_~i~0 > 0); 3462#L12 assume !(1 == main_~i~0); 3461#L12-2 assume !(10 == main_~i~0); 3460#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3459#L18-1 assume !!(main_~i~0 > 0); 3458#L12 assume !(1 == main_~i~0); 3457#L12-2 assume !(10 == main_~i~0); 3456#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3455#L18-1 assume !!(main_~i~0 > 0); 3454#L12 assume !(1 == main_~i~0); 3412#L12-2 assume !(10 == main_~i~0); 3422#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3418#L18-1 assume !!(main_~i~0 > 0); 3410#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3411#L12-2 [2019-11-16 00:03:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1563122355, now seen corresponding path program 8 times [2019-11-16 00:03:51,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:51,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275703270] [2019-11-16 00:03:51,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:51,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275703270] [2019-11-16 00:03:51,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444657216] [2019-11-16 00:03:51,468 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:51,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:03:51,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:51,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:51,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-16 00:03:51,540 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:51,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 14 [2019-11-16 00:03:51,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003360129] [2019-11-16 00:03:51,541 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:51,542 INFO L82 PathProgramCache]: Analyzing trace with hash 422622699, now seen corresponding path program 8 times [2019-11-16 00:03:51,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:51,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665579682] [2019-11-16 00:03:51,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:51,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665579682] [2019-11-16 00:03:51,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118139378] [2019-11-16 00:03:51,623 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:51,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:03:51,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:51,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:03:51,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:51,683 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:51,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-16 00:03:51,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621731537] [2019-11-16 00:03:51,684 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:03:51,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:51,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:03:51,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:03:51,685 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. cyclomatic complexity: 36 Second operand 11 states. [2019-11-16 00:03:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:51,786 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2019-11-16 00:03:51,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:03:51,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 184 transitions. [2019-11-16 00:03:51,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2019-11-16 00:03:51,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 147 states and 183 transitions. [2019-11-16 00:03:51,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2019-11-16 00:03:51,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2019-11-16 00:03:51,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 183 transitions. [2019-11-16 00:03:51,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:51,790 INFO L688 BuchiCegarLoop]: Abstraction has 147 states and 183 transitions. [2019-11-16 00:03:51,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 183 transitions. [2019-11-16 00:03:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2019-11-16 00:03:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-16 00:03:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2019-11-16 00:03:51,794 INFO L711 BuchiCegarLoop]: Abstraction has 140 states and 173 transitions. [2019-11-16 00:03:51,795 INFO L591 BuchiCegarLoop]: Abstraction has 140 states and 173 transitions. [2019-11-16 00:03:51,795 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-16 00:03:51,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 173 transitions. [2019-11-16 00:03:51,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-11-16 00:03:51,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:51,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:51,798 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 2, 1, 1] [2019-11-16 00:03:51,798 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2019-11-16 00:03:51,799 INFO L791 eck$LassoCheckResult]: Stem: 3928#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3929#L18-1 assume !!(main_~i~0 > 0); 3952#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3951#L12-2 assume !(10 == main_~i~0); 3950#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3949#L18-1 assume !!(main_~i~0 > 0); 3946#L12 assume !(1 == main_~i~0); 3948#L12-2 assume !(10 == main_~i~0); 3947#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3945#L18-1 assume !!(main_~i~0 > 0); 3944#L12 assume !(1 == main_~i~0); 3943#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3937#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3938#L18-1 assume !!(main_~i~0 > 0); 4004#L12 assume !(1 == main_~i~0); 4003#L12-2 assume !(10 == main_~i~0); 4002#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4001#L18-1 assume !!(main_~i~0 > 0); 4000#L12 assume !(1 == main_~i~0); 3999#L12-2 assume !(10 == main_~i~0); 3998#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3997#L18-1 assume !!(main_~i~0 > 0); 3996#L12 assume !(1 == main_~i~0); 3995#L12-2 assume !(10 == main_~i~0); 3994#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3993#L18-1 assume !!(main_~i~0 > 0); 3992#L12 assume !(1 == main_~i~0); 3991#L12-2 assume !(10 == main_~i~0); 3990#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3989#L18-1 assume !!(main_~i~0 > 0); 3988#L12 assume !(1 == main_~i~0); 3987#L12-2 assume !(10 == main_~i~0); 3986#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3985#L18-1 assume !!(main_~i~0 > 0); 3984#L12 assume !(1 == main_~i~0); 3983#L12-2 assume !(10 == main_~i~0); 3982#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3981#L18-1 assume !!(main_~i~0 > 0); 3980#L12 assume !(1 == main_~i~0); 3979#L12-2 assume !(10 == main_~i~0); 3978#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3977#L18-1 assume !!(main_~i~0 > 0); 3976#L12 assume !(1 == main_~i~0); 3958#L12-2 assume !(10 == main_~i~0); 3964#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3963#L18-1 assume !!(main_~i~0 > 0); 3957#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3941#L12-2 [2019-11-16 00:03:51,799 INFO L793 eck$LassoCheckResult]: Loop: 3941#L12-2 assume !(10 == main_~i~0); 3942#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3971#L18-1 assume !!(main_~i~0 > 0); 3961#L12 assume !(1 == main_~i~0); 3962#L12-2 assume !(10 == main_~i~0); 3973#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3974#L18-1 assume !!(main_~i~0 > 0); 4041#L12 assume !(1 == main_~i~0); 4039#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3924#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3940#L18-1 assume !!(main_~i~0 > 0); 3934#L12 assume !(1 == main_~i~0); 3935#L12-2 assume !(10 == main_~i~0); 4032#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4031#L18-1 assume !!(main_~i~0 > 0); 4030#L12 assume !(1 == main_~i~0); 4029#L12-2 assume !(10 == main_~i~0); 4028#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4027#L18-1 assume !!(main_~i~0 > 0); 4026#L12 assume !(1 == main_~i~0); 4025#L12-2 assume !(10 == main_~i~0); 4024#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4023#L18-1 assume !!(main_~i~0 > 0); 4022#L12 assume !(1 == main_~i~0); 4021#L12-2 assume !(10 == main_~i~0); 4020#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4019#L18-1 assume !!(main_~i~0 > 0); 4018#L12 assume !(1 == main_~i~0); 4017#L12-2 assume !(10 == main_~i~0); 4016#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4015#L18-1 assume !!(main_~i~0 > 0); 4014#L12 assume !(1 == main_~i~0); 4013#L12-2 assume !(10 == main_~i~0); 4012#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4011#L18-1 assume !!(main_~i~0 > 0); 4010#L12 assume !(1 == main_~i~0); 4009#L12-2 assume !(10 == main_~i~0); 4008#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4007#L18-1 assume !!(main_~i~0 > 0); 4006#L12 assume !(1 == main_~i~0); 3960#L12-2 assume !(10 == main_~i~0); 3970#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3968#L18-1 assume !!(main_~i~0 > 0); 3959#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3941#L12-2 [2019-11-16 00:03:51,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash 844978232, now seen corresponding path program 9 times [2019-11-16 00:03:51,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:51,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259215777] [2019-11-16 00:03:51,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:51,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259215777] [2019-11-16 00:03:51,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050632176] [2019-11-16 00:03:51,821 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:51,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-11-16 00:03:51,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:51,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:51,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:51,898 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:51,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-16 00:03:51,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700796840] [2019-11-16 00:03:51,899 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:51,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:51,899 INFO L82 PathProgramCache]: Analyzing trace with hash 82045398, now seen corresponding path program 9 times [2019-11-16 00:03:51,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:51,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618816273] [2019-11-16 00:03:51,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:51,912 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:52,084 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 45 [2019-11-16 00:03:52,092 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:52,092 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:52,093 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:52,093 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:52,093 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:52,093 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:52,093 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:52,093 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:52,093 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration16_Loop [2019-11-16 00:03:52,093 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:52,093 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:52,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:52,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:52,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:52,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:52,168 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:52,168 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:52,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:52,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:52,175 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:52,175 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_10=0} Honda state: {v_rep~unnamed0~0~false_10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:52,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:52,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:52,184 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:52,184 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_10=1} Honda state: {v_rep~unnamed0~0~true_10=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:52,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:52,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:52,191 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:52,191 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:52,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:52,199 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:52,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:52,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:52,213 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:52,215 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:52,215 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:52,215 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:52,215 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:52,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:52,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:52,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:52,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:52,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration16_Loop [2019-11-16 00:03:52,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:52,215 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:52,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:52,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:52,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:52,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:52,270 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:52,270 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:52,270 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:03:52,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:52,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:52,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:52,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:52,272 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:52,272 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:52,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:52,273 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:03:52,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:52,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:52,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:52,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:52,275 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:52,275 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:52,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:52,277 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:03:52,278 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:52,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:52,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:52,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:52,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:52,279 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:52,279 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:52,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:52,281 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:03:52,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:52,281 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:52,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:52,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:52,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:52,282 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:52,282 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:52,283 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:52,284 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:52,284 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:52,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:52,285 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:52,285 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:52,285 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:52,286 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:52,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:52,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:52,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:03:52,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:52,406 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-16 00:03:52,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 173 transitions. cyclomatic complexity: 39 Second operand 8 states. [2019-11-16 00:03:52,766 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 173 transitions. cyclomatic complexity: 39. Second operand 8 states. Result 378 states and 460 transitions. Complement of second has 27 states. [2019-11-16 00:03:52,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:03:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2019-11-16 00:03:52,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 38 transitions. Stem has 47 letters. Loop has 44 letters. [2019-11-16 00:03:52,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:52,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 38 transitions. Stem has 91 letters. Loop has 44 letters. [2019-11-16 00:03:52,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:52,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 38 transitions. Stem has 47 letters. Loop has 88 letters. [2019-11-16 00:03:52,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:52,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 460 transitions. [2019-11-16 00:03:52,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-11-16 00:03:52,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 289 states and 350 transitions. [2019-11-16 00:03:52,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2019-11-16 00:03:52,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-11-16 00:03:52,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 350 transitions. [2019-11-16 00:03:52,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:52,778 INFO L688 BuchiCegarLoop]: Abstraction has 289 states and 350 transitions. [2019-11-16 00:03:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 350 transitions. [2019-11-16 00:03:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 197. [2019-11-16 00:03:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-16 00:03:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 242 transitions. [2019-11-16 00:03:52,784 INFO L711 BuchiCegarLoop]: Abstraction has 197 states and 242 transitions. [2019-11-16 00:03:52,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:52,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:52,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:52,785 INFO L87 Difference]: Start difference. First operand 197 states and 242 transitions. Second operand 5 states. [2019-11-16 00:03:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:52,820 INFO L93 Difference]: Finished difference Result 167 states and 201 transitions. [2019-11-16 00:03:52,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:52,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 201 transitions. [2019-11-16 00:03:52,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2019-11-16 00:03:52,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 159 states and 192 transitions. [2019-11-16 00:03:52,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2019-11-16 00:03:52,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-11-16 00:03:52,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 192 transitions. [2019-11-16 00:03:52,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:52,826 INFO L688 BuchiCegarLoop]: Abstraction has 159 states and 192 transitions. [2019-11-16 00:03:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 192 transitions. [2019-11-16 00:03:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2019-11-16 00:03:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-16 00:03:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2019-11-16 00:03:52,830 INFO L711 BuchiCegarLoop]: Abstraction has 152 states and 185 transitions. [2019-11-16 00:03:52,830 INFO L591 BuchiCegarLoop]: Abstraction has 152 states and 185 transitions. [2019-11-16 00:03:52,830 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-16 00:03:52,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 185 transitions. [2019-11-16 00:03:52,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2019-11-16 00:03:52,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:52,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:52,833 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [13, 11, 11, 9, 3, 2, 1, 1] [2019-11-16 00:03:52,833 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 9, 3, 1, 1] [2019-11-16 00:03:52,833 INFO L791 eck$LassoCheckResult]: Stem: 5288#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5289#L18-1 assume !!(main_~i~0 > 0); 5316#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5315#L12-2 assume !(10 == main_~i~0); 5314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5313#L18-1 assume !!(main_~i~0 > 0); 5312#L12 assume !(1 == main_~i~0); 5311#L12-2 assume !(10 == main_~i~0); 5310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5309#L18-1 assume !!(main_~i~0 > 0); 5306#L12 assume !(1 == main_~i~0); 5308#L12-2 assume !(10 == main_~i~0); 5307#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5305#L18-1 assume !!(main_~i~0 > 0); 5304#L12 assume !(1 == main_~i~0); 5303#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5296#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5297#L18-1 assume !!(main_~i~0 > 0); 5359#L12 assume !(1 == main_~i~0); 5358#L12-2 assume !(10 == main_~i~0); 5357#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5356#L18-1 assume !!(main_~i~0 > 0); 5355#L12 assume !(1 == main_~i~0); 5354#L12-2 assume !(10 == main_~i~0); 5353#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5352#L18-1 assume !!(main_~i~0 > 0); 5351#L12 assume !(1 == main_~i~0); 5350#L12-2 assume !(10 == main_~i~0); 5349#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5348#L18-1 assume !!(main_~i~0 > 0); 5347#L12 assume !(1 == main_~i~0); 5346#L12-2 assume !(10 == main_~i~0); 5345#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5344#L18-1 assume !!(main_~i~0 > 0); 5343#L12 assume !(1 == main_~i~0); 5342#L12-2 assume !(10 == main_~i~0); 5341#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5340#L18-1 assume !!(main_~i~0 > 0); 5339#L12 assume !(1 == main_~i~0); 5338#L12-2 assume !(10 == main_~i~0); 5337#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5336#L18-1 assume !!(main_~i~0 > 0); 5335#L12 assume !(1 == main_~i~0); 5334#L12-2 assume !(10 == main_~i~0); 5333#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5332#L18-1 assume !!(main_~i~0 > 0); 5331#L12 assume !(1 == main_~i~0); 5326#L12-2 assume !(10 == main_~i~0); 5329#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5328#L18-1 assume !!(main_~i~0 > 0); 5324#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5325#L12-2 [2019-11-16 00:03:52,833 INFO L793 eck$LassoCheckResult]: Loop: 5325#L12-2 assume !(10 == main_~i~0); 5299#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5290#L18-1 assume !!(main_~i~0 > 0); 5291#L12 assume !(1 == main_~i~0); 5433#L12-2 assume !(10 == main_~i~0); 5435#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5434#L18-1 assume !!(main_~i~0 > 0); 5327#L12 assume !(1 == main_~i~0); 5301#L12-2 assume !(10 == main_~i~0); 5302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5431#L18-1 assume !!(main_~i~0 > 0); 5429#L12 assume !(1 == main_~i~0); 5427#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5285#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5300#L18-1 assume !!(main_~i~0 > 0); 5294#L12 assume !(1 == main_~i~0); 5295#L12-2 assume !(10 == main_~i~0); 5420#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5418#L18-1 assume !!(main_~i~0 > 0); 5416#L12 assume !(1 == main_~i~0); 5414#L12-2 assume !(10 == main_~i~0); 5412#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5410#L18-1 assume !!(main_~i~0 > 0); 5408#L12 assume !(1 == main_~i~0); 5406#L12-2 assume !(10 == main_~i~0); 5404#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5402#L18-1 assume !!(main_~i~0 > 0); 5400#L12 assume !(1 == main_~i~0); 5398#L12-2 assume !(10 == main_~i~0); 5396#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5394#L18-1 assume !!(main_~i~0 > 0); 5392#L12 assume !(1 == main_~i~0); 5390#L12-2 assume !(10 == main_~i~0); 5388#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5386#L18-1 assume !!(main_~i~0 > 0); 5384#L12 assume !(1 == main_~i~0); 5382#L12-2 assume !(10 == main_~i~0); 5380#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5378#L18-1 assume !!(main_~i~0 > 0); 5376#L12 assume !(1 == main_~i~0); 5374#L12-2 assume !(10 == main_~i~0); 5372#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5370#L18-1 assume !!(main_~i~0 > 0); 5368#L12 assume !(1 == main_~i~0); 5366#L12-2 assume !(10 == main_~i~0); 5364#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5360#L18-1 assume !!(main_~i~0 > 0); 5361#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5325#L12-2 [2019-11-16 00:03:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:52,834 INFO L82 PathProgramCache]: Analyzing trace with hash -890757087, now seen corresponding path program 10 times [2019-11-16 00:03:52,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:52,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536853276] [2019-11-16 00:03:52,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:52,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:52,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 137 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:52,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536853276] [2019-11-16 00:03:52,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600975228] [2019-11-16 00:03:52,880 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:52,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:03:52,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:52,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:03:52,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 137 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:52,958 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:52,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-16 00:03:52,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131476156] [2019-11-16 00:03:52,960 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash -294604097, now seen corresponding path program 10 times [2019-11-16 00:03:52,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:52,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683288693] [2019-11-16 00:03:52,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:52,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:52,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:52,975 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:53,149 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2019-11-16 00:03:53,164 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:53,164 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:53,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:53,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:53,164 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:53,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:53,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:53,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:53,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration17_Loop [2019-11-16 00:03:53,165 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:53,165 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:53,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:53,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:53,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:53,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:03:53,224 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:53,224 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:53,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:53,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:53,236 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:53,237 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:53,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:53,242 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:53,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:53,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:53,252 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:53,253 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:53,254 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:53,254 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:53,254 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:53,254 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:53,254 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:53,254 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:53,254 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:53,254 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration17_Loop [2019-11-16 00:03:53,254 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:53,254 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:53,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:53,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:53,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:53,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:53,302 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:53,302 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:53,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:53,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:53,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:53,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:53,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:53,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:53,304 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:53,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:53,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:53,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:53,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:53,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:53,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:53,308 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:53,308 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:53,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:53,309 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:03:53,309 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:53,309 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:53,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:53,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:53,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:53,310 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:53,310 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:53,311 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:53,313 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:53,313 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:53,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:53,314 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:53,314 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:53,314 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:53,315 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:53,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:53,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:53,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:03:53,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:53,414 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:03:53,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 185 transitions. cyclomatic complexity: 39 Second operand 7 states. [2019-11-16 00:03:53,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 185 transitions. cyclomatic complexity: 39. Second operand 7 states. Result 486 states and 584 transitions. Complement of second has 19 states. [2019-11-16 00:03:53,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:03:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2019-11-16 00:03:53,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 51 letters. Loop has 48 letters. [2019-11-16 00:03:53,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:53,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 99 letters. Loop has 48 letters. [2019-11-16 00:03:53,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:53,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 51 letters. Loop has 96 letters. [2019-11-16 00:03:53,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:53,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 486 states and 584 transitions. [2019-11-16 00:03:53,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2019-11-16 00:03:53,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 486 states to 419 states and 494 transitions. [2019-11-16 00:03:53,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2019-11-16 00:03:53,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2019-11-16 00:03:53,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 494 transitions. [2019-11-16 00:03:53,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:53,635 INFO L688 BuchiCegarLoop]: Abstraction has 419 states and 494 transitions. [2019-11-16 00:03:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 494 transitions. [2019-11-16 00:03:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 385. [2019-11-16 00:03:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-11-16 00:03:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 460 transitions. [2019-11-16 00:03:53,644 INFO L711 BuchiCegarLoop]: Abstraction has 385 states and 460 transitions. [2019-11-16 00:03:53,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:53,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:53,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:53,645 INFO L87 Difference]: Start difference. First operand 385 states and 460 transitions. Second operand 6 states. [2019-11-16 00:03:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:53,682 INFO L93 Difference]: Finished difference Result 195 states and 228 transitions. [2019-11-16 00:03:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:53,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 228 transitions. [2019-11-16 00:03:53,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2019-11-16 00:03:53,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 171 states and 204 transitions. [2019-11-16 00:03:53,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-16 00:03:53,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-16 00:03:53,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 204 transitions. [2019-11-16 00:03:53,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:53,687 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 204 transitions. [2019-11-16 00:03:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 204 transitions. [2019-11-16 00:03:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2019-11-16 00:03:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-16 00:03:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 197 transitions. [2019-11-16 00:03:53,690 INFO L711 BuchiCegarLoop]: Abstraction has 164 states and 197 transitions. [2019-11-16 00:03:53,690 INFO L591 BuchiCegarLoop]: Abstraction has 164 states and 197 transitions. [2019-11-16 00:03:53,690 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-16 00:03:53,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 197 transitions. [2019-11-16 00:03:53,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2019-11-16 00:03:53,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:53,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:53,699 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [14, 12, 12, 9, 4, 2, 1, 1] [2019-11-16 00:03:53,701 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] [2019-11-16 00:03:53,701 INFO L791 eck$LassoCheckResult]: Stem: 7004#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 7005#L18-1 assume !!(main_~i~0 > 0); 7033#L12 assume 1 == main_~i~0;main_~up~0 := 1; 7032#L12-2 assume !(10 == main_~i~0); 7031#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7030#L18-1 assume !!(main_~i~0 > 0); 7029#L12 assume !(1 == main_~i~0); 7028#L12-2 assume !(10 == main_~i~0); 7027#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7026#L18-1 assume !!(main_~i~0 > 0); 7025#L12 assume !(1 == main_~i~0); 7024#L12-2 assume !(10 == main_~i~0); 7023#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7022#L18-1 assume !!(main_~i~0 > 0); 7019#L12 assume !(1 == main_~i~0); 7021#L12-2 assume !(10 == main_~i~0); 7020#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7018#L18-1 assume !!(main_~i~0 > 0); 7017#L12 assume !(1 == main_~i~0); 7016#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 7011#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7012#L18-1 assume !!(main_~i~0 > 0); 7076#L12 assume !(1 == main_~i~0); 7075#L12-2 assume !(10 == main_~i~0); 7074#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7073#L18-1 assume !!(main_~i~0 > 0); 7072#L12 assume !(1 == main_~i~0); 7071#L12-2 assume !(10 == main_~i~0); 7070#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7069#L18-1 assume !!(main_~i~0 > 0); 7068#L12 assume !(1 == main_~i~0); 7067#L12-2 assume !(10 == main_~i~0); 7066#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7065#L18-1 assume !!(main_~i~0 > 0); 7064#L12 assume !(1 == main_~i~0); 7063#L12-2 assume !(10 == main_~i~0); 7062#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7061#L18-1 assume !!(main_~i~0 > 0); 7060#L12 assume !(1 == main_~i~0); 7059#L12-2 assume !(10 == main_~i~0); 7058#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7057#L18-1 assume !!(main_~i~0 > 0); 7056#L12 assume !(1 == main_~i~0); 7055#L12-2 assume !(10 == main_~i~0); 7054#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7053#L18-1 assume !!(main_~i~0 > 0); 7052#L12 assume !(1 == main_~i~0); 7051#L12-2 assume !(10 == main_~i~0); 7050#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7049#L18-1 assume !!(main_~i~0 > 0); 7048#L12 assume !(1 == main_~i~0); 7042#L12-2 assume !(10 == main_~i~0); 7046#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7045#L18-1 assume !!(main_~i~0 > 0); 7040#L12 assume 1 == main_~i~0;main_~up~0 := 1; 7041#L12-2 [2019-11-16 00:03:53,701 INFO L793 eck$LassoCheckResult]: Loop: 7041#L12-2 assume !(10 == main_~i~0); 7163#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7162#L18-1 assume !!(main_~i~0 > 0); 7043#L12 assume !(1 == main_~i~0); 7044#L12-2 assume !(10 == main_~i~0); 7161#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7160#L18-1 assume !!(main_~i~0 > 0); 7159#L12 assume !(1 == main_~i~0); 7158#L12-2 assume !(10 == main_~i~0); 7156#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7154#L18-1 assume !!(main_~i~0 > 0); 7152#L12 assume !(1 == main_~i~0); 7151#L12-2 assume !(10 == main_~i~0); 7146#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7149#L18-1 assume !!(main_~i~0 > 0); 7148#L12 assume !(1 == main_~i~0); 7145#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 7001#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7014#L18-1 assume !!(main_~i~0 > 0); 7141#L12 assume !(1 == main_~i~0); 7139#L12-2 assume !(10 == main_~i~0); 7137#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7135#L18-1 assume !!(main_~i~0 > 0); 7133#L12 assume !(1 == main_~i~0); 7131#L12-2 assume !(10 == main_~i~0); 7129#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7127#L18-1 assume !!(main_~i~0 > 0); 7125#L12 assume !(1 == main_~i~0); 7123#L12-2 assume !(10 == main_~i~0); 7121#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7119#L18-1 assume !!(main_~i~0 > 0); 7117#L12 assume !(1 == main_~i~0); 7115#L12-2 assume !(10 == main_~i~0); 7113#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7111#L18-1 assume !!(main_~i~0 > 0); 7109#L12 assume !(1 == main_~i~0); 7107#L12-2 assume !(10 == main_~i~0); 7105#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7103#L18-1 assume !!(main_~i~0 > 0); 7101#L12 assume !(1 == main_~i~0); 7099#L12-2 assume !(10 == main_~i~0); 7097#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7095#L18-1 assume !!(main_~i~0 > 0); 7093#L12 assume !(1 == main_~i~0); 7091#L12-2 assume !(10 == main_~i~0); 7089#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7087#L18-1 assume !!(main_~i~0 > 0); 7085#L12 assume !(1 == main_~i~0); 7084#L12-2 assume !(10 == main_~i~0); 7082#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7079#L18-1 assume !!(main_~i~0 > 0); 7080#L12 assume 1 == main_~i~0;main_~up~0 := 1; 7041#L12-2 [2019-11-16 00:03:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:53,702 INFO L82 PathProgramCache]: Analyzing trace with hash 260754314, now seen corresponding path program 11 times [2019-11-16 00:03:53,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:53,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842557819] [2019-11-16 00:03:53,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:53,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:53,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:53,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842557819] [2019-11-16 00:03:53,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981845933] [2019-11-16 00:03:53,747 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:53,809 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-16 00:03:53,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:53,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:03:53,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:53,819 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:53,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-16 00:03:53,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948889727] [2019-11-16 00:03:53,820 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1093459752, now seen corresponding path program 11 times [2019-11-16 00:03:53,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:53,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198255555] [2019-11-16 00:03:53,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:53,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:53,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:53,839 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:54,037 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 51 [2019-11-16 00:03:54,046 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:54,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:54,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:54,046 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:54,046 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:54,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:54,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:54,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:54,047 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration18_Loop [2019-11-16 00:03:54,047 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:54,047 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:54,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:54,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:54,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:54,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:54,096 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:54,096 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:54,099 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:54,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:54,103 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:54,103 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_14=1} Honda state: {v_rep~unnamed0~0~true_14=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:54,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:54,110 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:54,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:54,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:54,120 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:54,122 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:54,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:54,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:54,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:54,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:54,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:54,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:54,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:54,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration18_Loop [2019-11-16 00:03:54,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:54,122 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:54,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:54,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:54,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:54,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:54,189 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:54,189 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:54,189 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:03:54,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:54,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:54,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:54,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:54,190 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:54,191 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:54,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:54,192 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:03:54,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:54,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:54,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:54,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:54,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:54,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:54,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:54,194 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:54,195 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:54,195 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:54,195 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:54,196 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:54,196 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:54,196 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:54,196 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:54,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:54,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:54,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:03:54,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:54,309 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-16 00:03:54,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 197 transitions. cyclomatic complexity: 39 Second operand 8 states. [2019-11-16 00:03:54,550 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 197 transitions. cyclomatic complexity: 39. Second operand 8 states. Result 586 states and 700 transitions. Complement of second has 23 states. [2019-11-16 00:03:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:03:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2019-11-16 00:03:54,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 52 letters. [2019-11-16 00:03:54,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:54,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 107 letters. Loop has 52 letters. [2019-11-16 00:03:54,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:54,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 104 letters. [2019-11-16 00:03:54,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:54,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 586 states and 700 transitions. [2019-11-16 00:03:54,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2019-11-16 00:03:54,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 586 states to 485 states and 570 transitions. [2019-11-16 00:03:54,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-11-16 00:03:54,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-11-16 00:03:54,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 570 transitions. [2019-11-16 00:03:54,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:54,567 INFO L688 BuchiCegarLoop]: Abstraction has 485 states and 570 transitions. [2019-11-16 00:03:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 570 transitions. [2019-11-16 00:03:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 441. [2019-11-16 00:03:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-16 00:03:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 526 transitions. [2019-11-16 00:03:54,576 INFO L711 BuchiCegarLoop]: Abstraction has 441 states and 526 transitions. [2019-11-16 00:03:54,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:54,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:54,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:54,577 INFO L87 Difference]: Start difference. First operand 441 states and 526 transitions. Second operand 7 states. [2019-11-16 00:03:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:54,624 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2019-11-16 00:03:54,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:54,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 248 transitions. [2019-11-16 00:03:54,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2019-11-16 00:03:54,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 183 states and 216 transitions. [2019-11-16 00:03:54,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2019-11-16 00:03:54,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2019-11-16 00:03:54,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 216 transitions. [2019-11-16 00:03:54,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:54,629 INFO L688 BuchiCegarLoop]: Abstraction has 183 states and 216 transitions. [2019-11-16 00:03:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 216 transitions. [2019-11-16 00:03:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2019-11-16 00:03:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-16 00:03:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 209 transitions. [2019-11-16 00:03:54,632 INFO L711 BuchiCegarLoop]: Abstraction has 176 states and 209 transitions. [2019-11-16 00:03:54,632 INFO L591 BuchiCegarLoop]: Abstraction has 176 states and 209 transitions. [2019-11-16 00:03:54,632 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-16 00:03:54,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 209 transitions. [2019-11-16 00:03:54,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2019-11-16 00:03:54,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:54,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:54,634 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [15, 13, 13, 9, 5, 2, 1, 1] [2019-11-16 00:03:54,634 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 9, 5, 1, 1] [2019-11-16 00:03:54,634 INFO L791 eck$LassoCheckResult]: Stem: 8953#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 8954#L18-1 assume !!(main_~i~0 > 0); 8986#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8985#L12-2 assume !(10 == main_~i~0); 8984#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8983#L18-1 assume !!(main_~i~0 > 0); 8982#L12 assume !(1 == main_~i~0); 8981#L12-2 assume !(10 == main_~i~0); 8980#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8979#L18-1 assume !!(main_~i~0 > 0); 8978#L12 assume !(1 == main_~i~0); 8977#L12-2 assume !(10 == main_~i~0); 8976#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8975#L18-1 assume !!(main_~i~0 > 0); 8974#L12 assume !(1 == main_~i~0); 8973#L12-2 assume !(10 == main_~i~0); 8972#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8971#L18-1 assume !!(main_~i~0 > 0); 8968#L12 assume !(1 == main_~i~0); 8970#L12-2 assume !(10 == main_~i~0); 8969#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8967#L18-1 assume !!(main_~i~0 > 0); 8966#L12 assume !(1 == main_~i~0); 8965#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 8960#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8961#L18-1 assume !!(main_~i~0 > 0); 9029#L12 assume !(1 == main_~i~0); 9028#L12-2 assume !(10 == main_~i~0); 9027#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9026#L18-1 assume !!(main_~i~0 > 0); 9025#L12 assume !(1 == main_~i~0); 9024#L12-2 assume !(10 == main_~i~0); 9023#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9022#L18-1 assume !!(main_~i~0 > 0); 9021#L12 assume !(1 == main_~i~0); 9020#L12-2 assume !(10 == main_~i~0); 9019#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9018#L18-1 assume !!(main_~i~0 > 0); 9017#L12 assume !(1 == main_~i~0); 9016#L12-2 assume !(10 == main_~i~0); 9015#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9014#L18-1 assume !!(main_~i~0 > 0); 9013#L12 assume !(1 == main_~i~0); 9012#L12-2 assume !(10 == main_~i~0); 9011#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9010#L18-1 assume !!(main_~i~0 > 0); 9009#L12 assume !(1 == main_~i~0); 9008#L12-2 assume !(10 == main_~i~0); 9007#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9006#L18-1 assume !!(main_~i~0 > 0); 9005#L12 assume !(1 == main_~i~0); 9004#L12-2 assume !(10 == main_~i~0); 9003#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9002#L18-1 assume !!(main_~i~0 > 0); 9001#L12 assume !(1 == main_~i~0); 8995#L12-2 assume !(10 == main_~i~0); 8999#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8998#L18-1 assume !!(main_~i~0 > 0); 8993#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8994#L12-2 [2019-11-16 00:03:54,634 INFO L793 eck$LassoCheckResult]: Loop: 8994#L12-2 assume !(10 == main_~i~0); 9124#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9121#L18-1 assume !!(main_~i~0 > 0); 8996#L12 assume !(1 == main_~i~0); 8997#L12-2 assume !(10 == main_~i~0); 9123#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9122#L18-1 assume !!(main_~i~0 > 0); 9120#L12 assume !(1 == main_~i~0); 9119#L12-2 assume !(10 == main_~i~0); 9118#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9117#L18-1 assume !!(main_~i~0 > 0); 9115#L12 assume !(1 == main_~i~0); 9113#L12-2 assume !(10 == main_~i~0); 9111#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9109#L18-1 assume !!(main_~i~0 > 0); 9107#L12 assume !(1 == main_~i~0); 9105#L12-2 assume !(10 == main_~i~0); 9100#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9103#L18-1 assume !!(main_~i~0 > 0); 9101#L12 assume !(1 == main_~i~0); 9099#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 8950#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8963#L18-1 assume !!(main_~i~0 > 0); 9093#L12 assume !(1 == main_~i~0); 9091#L12-2 assume !(10 == main_~i~0); 9089#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9087#L18-1 assume !!(main_~i~0 > 0); 9085#L12 assume !(1 == main_~i~0); 9083#L12-2 assume !(10 == main_~i~0); 9081#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9079#L18-1 assume !!(main_~i~0 > 0); 9077#L12 assume !(1 == main_~i~0); 9075#L12-2 assume !(10 == main_~i~0); 9073#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9071#L18-1 assume !!(main_~i~0 > 0); 9069#L12 assume !(1 == main_~i~0); 9067#L12-2 assume !(10 == main_~i~0); 9065#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9063#L18-1 assume !!(main_~i~0 > 0); 9061#L12 assume !(1 == main_~i~0); 9059#L12-2 assume !(10 == main_~i~0); 9057#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9055#L18-1 assume !!(main_~i~0 > 0); 9053#L12 assume !(1 == main_~i~0); 9051#L12-2 assume !(10 == main_~i~0); 9049#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9047#L18-1 assume !!(main_~i~0 > 0); 9045#L12 assume !(1 == main_~i~0); 9043#L12-2 assume !(10 == main_~i~0); 9041#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9039#L18-1 assume !!(main_~i~0 > 0); 9038#L12 assume !(1 == main_~i~0); 9036#L12-2 assume !(10 == main_~i~0); 9034#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9030#L18-1 assume !!(main_~i~0 > 0); 9031#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8994#L12-2 [2019-11-16 00:03:54,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1566074253, now seen corresponding path program 12 times [2019-11-16 00:03:54,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:54,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720297217] [2019-11-16 00:03:54,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:54,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:54,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 211 proven. 45 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:54,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720297217] [2019-11-16 00:03:54,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423401353] [2019-11-16 00:03:54,695 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:54,770 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-11-16 00:03:54,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:54,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:03:54,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 211 proven. 45 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:54,794 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:54,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-16 00:03:54,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966282328] [2019-11-16 00:03:54,795 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1203416849, now seen corresponding path program 12 times [2019-11-16 00:03:54,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:54,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249677899] [2019-11-16 00:03:54,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:54,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:54,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:54,811 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:55,016 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 54 [2019-11-16 00:03:55,027 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:55,027 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:55,027 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:55,027 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:55,027 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:55,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:55,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:55,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:55,027 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration19_Loop [2019-11-16 00:03:55,027 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:55,027 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:55,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:55,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:55,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:55,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:55,077 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:55,078 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) [2019-11-16 00:03:55,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:55,089 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:55,092 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:55,092 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:55,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:55,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:55,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:55,099 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:55,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:55,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:55,108 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:55,108 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_16=0} Honda state: {v_rep~unnamed0~0~false_16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:55,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:55,117 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:55,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:55,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:55,127 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:55,129 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:55,129 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:55,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:55,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:55,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:55,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:55,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:55,129 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:55,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration19_Loop [2019-11-16 00:03:55,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:55,130 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:55,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:55,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:55,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:55,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:55,202 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:55,202 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:55,202 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:03:55,203 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:55,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:55,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:55,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:55,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:55,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:55,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:55,205 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:03:55,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:55,205 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:55,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:55,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:55,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:55,206 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:55,206 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:55,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:55,207 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:03:55,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:55,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:55,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:55,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:55,208 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:55,208 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:55,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:55,210 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:03:55,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:55,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:55,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:55,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:55,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:55,211 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:55,211 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:55,212 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:55,213 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:55,213 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:55,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:55,214 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:55,214 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:55,214 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:55,215 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:55,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:55,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:55,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:03:55,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:55,333 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-16 00:03:55,334 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 209 transitions. cyclomatic complexity: 39 Second operand 9 states. [2019-11-16 00:03:55,633 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 209 transitions. cyclomatic complexity: 39. Second operand 9 states. Result 702 states and 836 transitions. Complement of second has 27 states. [2019-11-16 00:03:55,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:03:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2019-11-16 00:03:55,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 59 letters. Loop has 56 letters. [2019-11-16 00:03:55,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:55,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 115 letters. Loop has 56 letters. [2019-11-16 00:03:55,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:55,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 59 letters. Loop has 112 letters. [2019-11-16 00:03:55,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:55,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 702 states and 836 transitions. [2019-11-16 00:03:55,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2019-11-16 00:03:55,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 702 states to 559 states and 656 transitions. [2019-11-16 00:03:55,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2019-11-16 00:03:55,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2019-11-16 00:03:55,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 559 states and 656 transitions. [2019-11-16 00:03:55,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:55,648 INFO L688 BuchiCegarLoop]: Abstraction has 559 states and 656 transitions. [2019-11-16 00:03:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states and 656 transitions. [2019-11-16 00:03:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 505. [2019-11-16 00:03:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-16 00:03:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 602 transitions. [2019-11-16 00:03:55,661 INFO L711 BuchiCegarLoop]: Abstraction has 505 states and 602 transitions. [2019-11-16 00:03:55,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:55,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:03:55,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:55,662 INFO L87 Difference]: Start difference. First operand 505 states and 602 transitions. Second operand 8 states. [2019-11-16 00:03:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:55,714 INFO L93 Difference]: Finished difference Result 235 states and 268 transitions. [2019-11-16 00:03:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:03:55,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 268 transitions. [2019-11-16 00:03:55,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-11-16 00:03:55,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 195 states and 228 transitions. [2019-11-16 00:03:55,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-16 00:03:55,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-16 00:03:55,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 228 transitions. [2019-11-16 00:03:55,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:55,719 INFO L688 BuchiCegarLoop]: Abstraction has 195 states and 228 transitions. [2019-11-16 00:03:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 228 transitions. [2019-11-16 00:03:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 188. [2019-11-16 00:03:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-16 00:03:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 221 transitions. [2019-11-16 00:03:55,723 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 221 transitions. [2019-11-16 00:03:55,723 INFO L591 BuchiCegarLoop]: Abstraction has 188 states and 221 transitions. [2019-11-16 00:03:55,723 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-16 00:03:55,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 221 transitions. [2019-11-16 00:03:55,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2019-11-16 00:03:55,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:55,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:55,726 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 2, 1, 1] [2019-11-16 00:03:55,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2019-11-16 00:03:55,726 INFO L791 eck$LassoCheckResult]: Stem: 11159#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 11160#L18-1 assume !!(main_~i~0 > 0); 11198#L12 assume 1 == main_~i~0;main_~up~0 := 1; 11197#L12-2 assume !(10 == main_~i~0); 11196#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11195#L18-1 assume !!(main_~i~0 > 0); 11194#L12 assume !(1 == main_~i~0); 11193#L12-2 assume !(10 == main_~i~0); 11192#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11191#L18-1 assume !!(main_~i~0 > 0); 11190#L12 assume !(1 == main_~i~0); 11189#L12-2 assume !(10 == main_~i~0); 11188#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11187#L18-1 assume !!(main_~i~0 > 0); 11186#L12 assume !(1 == main_~i~0); 11185#L12-2 assume !(10 == main_~i~0); 11184#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11183#L18-1 assume !!(main_~i~0 > 0); 11182#L12 assume !(1 == main_~i~0); 11181#L12-2 assume !(10 == main_~i~0); 11180#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11179#L18-1 assume !!(main_~i~0 > 0); 11176#L12 assume !(1 == main_~i~0); 11178#L12-2 assume !(10 == main_~i~0); 11177#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11175#L18-1 assume !!(main_~i~0 > 0); 11174#L12 assume !(1 == main_~i~0); 11173#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 11167#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11168#L18-1 assume !!(main_~i~0 > 0); 11241#L12 assume !(1 == main_~i~0); 11240#L12-2 assume !(10 == main_~i~0); 11239#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11238#L18-1 assume !!(main_~i~0 > 0); 11237#L12 assume !(1 == main_~i~0); 11236#L12-2 assume !(10 == main_~i~0); 11235#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11234#L18-1 assume !!(main_~i~0 > 0); 11233#L12 assume !(1 == main_~i~0); 11232#L12-2 assume !(10 == main_~i~0); 11231#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11230#L18-1 assume !!(main_~i~0 > 0); 11229#L12 assume !(1 == main_~i~0); 11228#L12-2 assume !(10 == main_~i~0); 11227#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11226#L18-1 assume !!(main_~i~0 > 0); 11225#L12 assume !(1 == main_~i~0); 11224#L12-2 assume !(10 == main_~i~0); 11223#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11222#L18-1 assume !!(main_~i~0 > 0); 11221#L12 assume !(1 == main_~i~0); 11220#L12-2 assume !(10 == main_~i~0); 11219#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11218#L18-1 assume !!(main_~i~0 > 0); 11217#L12 assume !(1 == main_~i~0); 11216#L12-2 assume !(10 == main_~i~0); 11215#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11214#L18-1 assume !!(main_~i~0 > 0); 11213#L12 assume !(1 == main_~i~0); 11206#L12-2 assume !(10 == main_~i~0); 11211#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11210#L18-1 assume !!(main_~i~0 > 0); 11204#L12 assume 1 == main_~i~0;main_~up~0 := 1; 11205#L12-2 [2019-11-16 00:03:55,726 INFO L793 eck$LassoCheckResult]: Loop: 11205#L12-2 assume !(10 == main_~i~0); 11336#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11334#L18-1 assume !!(main_~i~0 > 0); 11208#L12 assume !(1 == main_~i~0); 11209#L12-2 assume !(10 == main_~i~0); 11330#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11329#L18-1 assume !!(main_~i~0 > 0); 11328#L12 assume !(1 == main_~i~0); 11327#L12-2 assume !(10 == main_~i~0); 11326#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11325#L18-1 assume !!(main_~i~0 > 0); 11324#L12 assume !(1 == main_~i~0); 11323#L12-2 assume !(10 == main_~i~0); 11322#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11321#L18-1 assume !!(main_~i~0 > 0); 11320#L12 assume !(1 == main_~i~0); 11319#L12-2 assume !(10 == main_~i~0); 11318#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11317#L18-1 assume !!(main_~i~0 > 0); 11316#L12 assume !(1 == main_~i~0); 11315#L12-2 assume !(10 == main_~i~0); 11311#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11313#L18-1 assume !!(main_~i~0 > 0); 11312#L12 assume !(1 == main_~i~0); 11310#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 11156#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11171#L18-1 assume !!(main_~i~0 > 0); 11165#L12 assume !(1 == main_~i~0); 11166#L12-2 assume !(10 == main_~i~0); 11302#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11300#L18-1 assume !!(main_~i~0 > 0); 11298#L12 assume !(1 == main_~i~0); 11296#L12-2 assume !(10 == main_~i~0); 11294#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11292#L18-1 assume !!(main_~i~0 > 0); 11290#L12 assume !(1 == main_~i~0); 11288#L12-2 assume !(10 == main_~i~0); 11286#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11284#L18-1 assume !!(main_~i~0 > 0); 11282#L12 assume !(1 == main_~i~0); 11280#L12-2 assume !(10 == main_~i~0); 11278#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11276#L18-1 assume !!(main_~i~0 > 0); 11274#L12 assume !(1 == main_~i~0); 11272#L12-2 assume !(10 == main_~i~0); 11270#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11268#L18-1 assume !!(main_~i~0 > 0); 11266#L12 assume !(1 == main_~i~0); 11264#L12-2 assume !(10 == main_~i~0); 11262#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11260#L18-1 assume !!(main_~i~0 > 0); 11258#L12 assume !(1 == main_~i~0); 11256#L12-2 assume !(10 == main_~i~0); 11254#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11252#L18-1 assume !!(main_~i~0 > 0); 11250#L12 assume !(1 == main_~i~0); 11248#L12-2 assume !(10 == main_~i~0); 11246#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11242#L18-1 assume !!(main_~i~0 > 0); 11243#L12 assume 1 == main_~i~0;main_~up~0 := 1; 11205#L12-2 [2019-11-16 00:03:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1417622308, now seen corresponding path program 13 times [2019-11-16 00:03:55,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:55,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842841481] [2019-11-16 00:03:55,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 248 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:55,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842841481] [2019-11-16 00:03:55,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307987186] [2019-11-16 00:03:55,784 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:55,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:03:55,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 248 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:55,865 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:55,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-16 00:03:55,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246479122] [2019-11-16 00:03:55,866 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1315151238, now seen corresponding path program 13 times [2019-11-16 00:03:55,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:55,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621356428] [2019-11-16 00:03:55,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:55,877 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:56,173 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 57 [2019-11-16 00:03:56,180 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:56,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:56,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:56,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:56,181 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:56,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:56,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:56,181 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:56,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration20_Loop [2019-11-16 00:03:56,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:56,181 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:56,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:56,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:56,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:03:56,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:56,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:56,234 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:56,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:56,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:56,241 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:56,241 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_18=1} Honda state: {v_rep~unnamed0~0~true_18=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:56,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:56,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:56,248 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:56,249 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:56,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:56,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:56,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:56,256 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_18=0} Honda state: {v_rep~unnamed0~0~false_18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:56,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:56,261 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:56,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:56,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:56,272 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:56,273 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:56,273 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:56,273 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:56,273 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:56,273 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:56,273 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:56,273 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:56,273 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:56,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration20_Loop [2019-11-16 00:03:56,273 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:56,274 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:56,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:56,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:03:56,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:56,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:56,325 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:56,325 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:56,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:03:56,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:56,326 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:56,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:56,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:56,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:56,326 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:56,326 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:56,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:56,327 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:03:56,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:56,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:56,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:56,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:56,329 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:56,329 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:56,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:56,330 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:03:56,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:56,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:56,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:56,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:56,331 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:56,331 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:56,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:56,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:03:56,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:56,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:56,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:56,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:56,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:56,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:56,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:56,335 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:56,336 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:56,336 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:56,336 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:56,336 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:56,336 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:56,336 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:56,337 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:56,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:03:56,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:56,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-11-16 00:03:56,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 221 transitions. cyclomatic complexity: 39 Second operand 10 states. [2019-11-16 00:03:56,760 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 221 transitions. cyclomatic complexity: 39. Second operand 10 states. Result 834 states and 992 transitions. Complement of second has 31 states. [2019-11-16 00:03:56,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:03:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2019-11-16 00:03:56,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 63 letters. Loop has 60 letters. [2019-11-16 00:03:56,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:56,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 123 letters. Loop has 60 letters. [2019-11-16 00:03:56,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:56,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 63 letters. Loop has 120 letters. [2019-11-16 00:03:56,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:56,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 834 states and 992 transitions. [2019-11-16 00:03:56,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2019-11-16 00:03:56,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 834 states to 641 states and 752 transitions. [2019-11-16 00:03:56,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2019-11-16 00:03:56,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2019-11-16 00:03:56,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 641 states and 752 transitions. [2019-11-16 00:03:56,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:56,778 INFO L688 BuchiCegarLoop]: Abstraction has 641 states and 752 transitions. [2019-11-16 00:03:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states and 752 transitions. [2019-11-16 00:03:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 577. [2019-11-16 00:03:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-11-16 00:03:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 688 transitions. [2019-11-16 00:03:56,789 INFO L711 BuchiCegarLoop]: Abstraction has 577 states and 688 transitions. [2019-11-16 00:03:56,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:56,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:03:56,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:03:56,790 INFO L87 Difference]: Start difference. First operand 577 states and 688 transitions. Second operand 9 states. [2019-11-16 00:03:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:56,864 INFO L93 Difference]: Finished difference Result 255 states and 288 transitions. [2019-11-16 00:03:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:03:56,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 288 transitions. [2019-11-16 00:03:56,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-16 00:03:56,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 207 states and 240 transitions. [2019-11-16 00:03:56,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2019-11-16 00:03:56,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2019-11-16 00:03:56,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 240 transitions. [2019-11-16 00:03:56,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:56,868 INFO L688 BuchiCegarLoop]: Abstraction has 207 states and 240 transitions. [2019-11-16 00:03:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 240 transitions. [2019-11-16 00:03:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2019-11-16 00:03:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-16 00:03:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2019-11-16 00:03:56,872 INFO L711 BuchiCegarLoop]: Abstraction has 200 states and 233 transitions. [2019-11-16 00:03:56,872 INFO L591 BuchiCegarLoop]: Abstraction has 200 states and 233 transitions. [2019-11-16 00:03:56,872 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-16 00:03:56,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 233 transitions. [2019-11-16 00:03:56,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-11-16 00:03:56,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:56,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:56,875 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 15, 9, 7, 2, 1, 1] [2019-11-16 00:03:56,875 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 9, 7, 1, 1] [2019-11-16 00:03:56,875 INFO L791 eck$LassoCheckResult]: Stem: 13646#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 13647#L18-1 assume !!(main_~i~0 > 0); 13688#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13687#L12-2 assume !(10 == main_~i~0); 13686#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13685#L18-1 assume !!(main_~i~0 > 0); 13684#L12 assume !(1 == main_~i~0); 13683#L12-2 assume !(10 == main_~i~0); 13682#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13681#L18-1 assume !!(main_~i~0 > 0); 13680#L12 assume !(1 == main_~i~0); 13679#L12-2 assume !(10 == main_~i~0); 13678#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13677#L18-1 assume !!(main_~i~0 > 0); 13676#L12 assume !(1 == main_~i~0); 13675#L12-2 assume !(10 == main_~i~0); 13674#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13673#L18-1 assume !!(main_~i~0 > 0); 13672#L12 assume !(1 == main_~i~0); 13671#L12-2 assume !(10 == main_~i~0); 13670#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13669#L18-1 assume !!(main_~i~0 > 0); 13668#L12 assume !(1 == main_~i~0); 13667#L12-2 assume !(10 == main_~i~0); 13666#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13665#L18-1 assume !!(main_~i~0 > 0); 13662#L12 assume !(1 == main_~i~0); 13664#L12-2 assume !(10 == main_~i~0); 13663#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13661#L18-1 assume !!(main_~i~0 > 0); 13660#L12 assume !(1 == main_~i~0); 13659#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 13654#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13655#L18-1 assume !!(main_~i~0 > 0); 13826#L12 assume !(1 == main_~i~0); 13825#L12-2 assume !(10 == main_~i~0); 13824#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13823#L18-1 assume !!(main_~i~0 > 0); 13815#L12 assume !(1 == main_~i~0); 13812#L12-2 assume !(10 == main_~i~0); 13809#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13806#L18-1 assume !!(main_~i~0 > 0); 13803#L12 assume !(1 == main_~i~0); 13800#L12-2 assume !(10 == main_~i~0); 13797#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13794#L18-1 assume !!(main_~i~0 > 0); 13791#L12 assume !(1 == main_~i~0); 13788#L12-2 assume !(10 == main_~i~0); 13785#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13782#L18-1 assume !!(main_~i~0 > 0); 13779#L12 assume !(1 == main_~i~0); 13776#L12-2 assume !(10 == main_~i~0); 13773#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13770#L18-1 assume !!(main_~i~0 > 0); 13767#L12 assume !(1 == main_~i~0); 13764#L12-2 assume !(10 == main_~i~0); 13761#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13758#L18-1 assume !!(main_~i~0 > 0); 13755#L12 assume !(1 == main_~i~0); 13752#L12-2 assume !(10 == main_~i~0); 13749#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13746#L18-1 assume !!(main_~i~0 > 0); 13743#L12 assume !(1 == main_~i~0); 13731#L12-2 assume !(10 == main_~i~0); 13739#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13736#L18-1 assume !!(main_~i~0 > 0); 13730#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13642#L12-2 [2019-11-16 00:03:56,876 INFO L793 eck$LassoCheckResult]: Loop: 13642#L12-2 assume !(10 == main_~i~0); 13643#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13727#L18-1 assume !!(main_~i~0 > 0); 13726#L12 assume !(1 == main_~i~0); 13725#L12-2 assume !(10 == main_~i~0); 13724#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13723#L18-1 assume !!(main_~i~0 > 0); 13722#L12 assume !(1 == main_~i~0); 13721#L12-2 assume !(10 == main_~i~0); 13720#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13719#L18-1 assume !!(main_~i~0 > 0); 13718#L12 assume !(1 == main_~i~0); 13717#L12-2 assume !(10 == main_~i~0); 13716#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13715#L18-1 assume !!(main_~i~0 > 0); 13714#L12 assume !(1 == main_~i~0); 13713#L12-2 assume !(10 == main_~i~0); 13712#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13711#L18-1 assume !!(main_~i~0 > 0); 13710#L12 assume !(1 == main_~i~0); 13709#L12-2 assume !(10 == main_~i~0); 13708#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13707#L18-1 assume !!(main_~i~0 > 0); 13706#L12 assume !(1 == main_~i~0); 13705#L12-2 assume !(10 == main_~i~0); 13697#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13702#L18-1 assume !!(main_~i~0 > 0); 13699#L12 assume !(1 == main_~i~0); 13696#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 13657#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13658#L18-1 assume !!(main_~i~0 > 0); 13652#L12 assume !(1 == main_~i~0); 13653#L12-2 assume !(10 == main_~i~0); 13695#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13818#L18-1 assume !!(main_~i~0 > 0); 13816#L12 assume !(1 == main_~i~0); 13813#L12-2 assume !(10 == main_~i~0); 13810#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13807#L18-1 assume !!(main_~i~0 > 0); 13804#L12 assume !(1 == main_~i~0); 13801#L12-2 assume !(10 == main_~i~0); 13798#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13795#L18-1 assume !!(main_~i~0 > 0); 13792#L12 assume !(1 == main_~i~0); 13789#L12-2 assume !(10 == main_~i~0); 13786#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13783#L18-1 assume !!(main_~i~0 > 0); 13780#L12 assume !(1 == main_~i~0); 13777#L12-2 assume !(10 == main_~i~0); 13774#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13771#L18-1 assume !!(main_~i~0 > 0); 13768#L12 assume !(1 == main_~i~0); 13765#L12-2 assume !(10 == main_~i~0); 13762#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13759#L18-1 assume !!(main_~i~0 > 0); 13756#L12 assume !(1 == main_~i~0); 13753#L12-2 assume !(10 == main_~i~0); 13750#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13747#L18-1 assume !!(main_~i~0 > 0); 13744#L12 assume !(1 == main_~i~0); 13733#L12-2 assume !(10 == main_~i~0); 13740#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13737#L18-1 assume !!(main_~i~0 > 0); 13732#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13642#L12-2 [2019-11-16 00:03:56,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:56,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1714987717, now seen corresponding path program 14 times [2019-11-16 00:03:56,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:56,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772699586] [2019-11-16 00:03:56,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:56,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:56,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 285 proven. 91 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:56,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772699586] [2019-11-16 00:03:56,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426565931] [2019-11-16 00:03:56,951 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:57,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:03:57,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:57,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:03:57,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 285 proven. 91 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:57,039 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:57,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-16 00:03:57,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482635699] [2019-11-16 00:03:57,040 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:57,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash 590625123, now seen corresponding path program 14 times [2019-11-16 00:03:57,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:57,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125060465] [2019-11-16 00:03:57,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:57,056 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:57,309 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 60 [2019-11-16 00:03:57,317 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:57,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:57,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:57,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:57,317 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:57,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:57,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:57,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:57,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration21_Loop [2019-11-16 00:03:57,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:57,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:57,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:57,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:57,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:57,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:57,373 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:57,373 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:57,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:57,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:57,379 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:57,379 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:57,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:57,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:57,394 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:57,394 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_20=0} Honda state: {v_rep~unnamed0~0~false_20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:57,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:57,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:57,402 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:57,402 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_20=1} Honda state: {v_rep~unnamed0~0~true_20=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:57,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:57,407 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:57,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:57,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:57,420 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:57,421 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:57,421 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:57,422 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:57,422 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:57,422 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:57,422 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:57,422 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:57,422 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:57,422 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration21_Loop [2019-11-16 00:03:57,422 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:57,422 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:57,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:57,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:57,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:57,484 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:57,484 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:57,485 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:03:57,485 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:57,485 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:57,485 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:57,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:57,486 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:57,486 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:57,486 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:57,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:57,487 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:03:57,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:57,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:57,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:57,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:57,488 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:57,489 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:57,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:57,490 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:03:57,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:57,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:57,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:57,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:57,491 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:57,491 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:57,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:57,492 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:03:57,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:57,493 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:57,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:57,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:57,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:57,493 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:57,493 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:57,494 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:57,495 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:57,495 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:57,496 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:57,496 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:57,496 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:57,497 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:57,497 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:57,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:57,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:03:57,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 344 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:57,663 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-16 00:03:57,663 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 233 transitions. cyclomatic complexity: 39 Second operand 11 states. [2019-11-16 00:03:58,063 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 233 transitions. cyclomatic complexity: 39. Second operand 11 states. Result 982 states and 1168 transitions. Complement of second has 35 states. [2019-11-16 00:03:58,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:03:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2019-11-16 00:03:58,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 67 letters. Loop has 64 letters. [2019-11-16 00:03:58,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:58,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 131 letters. Loop has 64 letters. [2019-11-16 00:03:58,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:58,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 67 letters. Loop has 128 letters. [2019-11-16 00:03:58,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:58,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 982 states and 1168 transitions. [2019-11-16 00:03:58,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68 [2019-11-16 00:03:58,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 982 states to 731 states and 858 transitions. [2019-11-16 00:03:58,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2019-11-16 00:03:58,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2019-11-16 00:03:58,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 731 states and 858 transitions. [2019-11-16 00:03:58,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:58,078 INFO L688 BuchiCegarLoop]: Abstraction has 731 states and 858 transitions. [2019-11-16 00:03:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states and 858 transitions. [2019-11-16 00:03:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 657. [2019-11-16 00:03:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-16 00:03:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 784 transitions. [2019-11-16 00:03:58,090 INFO L711 BuchiCegarLoop]: Abstraction has 657 states and 784 transitions. [2019-11-16 00:03:58,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:03:58,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:03:58,091 INFO L87 Difference]: Start difference. First operand 657 states and 784 transitions. Second operand 10 states. [2019-11-16 00:03:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:58,163 INFO L93 Difference]: Finished difference Result 275 states and 308 transitions. [2019-11-16 00:03:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:03:58,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 308 transitions. [2019-11-16 00:03:58,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-11-16 00:03:58,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 219 states and 252 transitions. [2019-11-16 00:03:58,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-11-16 00:03:58,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-11-16 00:03:58,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 252 transitions. [2019-11-16 00:03:58,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:58,167 INFO L688 BuchiCegarLoop]: Abstraction has 219 states and 252 transitions. [2019-11-16 00:03:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 252 transitions. [2019-11-16 00:03:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2019-11-16 00:03:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-16 00:03:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 245 transitions. [2019-11-16 00:03:58,171 INFO L711 BuchiCegarLoop]: Abstraction has 212 states and 245 transitions. [2019-11-16 00:03:58,171 INFO L591 BuchiCegarLoop]: Abstraction has 212 states and 245 transitions. [2019-11-16 00:03:58,171 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-16 00:03:58,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 245 transitions. [2019-11-16 00:03:58,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-16 00:03:58,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:58,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:58,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [18, 16, 16, 9, 8, 2, 1, 1] [2019-11-16 00:03:58,176 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 9, 8, 1, 1] [2019-11-16 00:03:58,176 INFO L791 eck$LassoCheckResult]: Stem: 16438#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 16439#L18-1 assume !!(main_~i~0 > 0); 16484#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16483#L12-2 assume !(10 == main_~i~0); 16482#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16481#L18-1 assume !!(main_~i~0 > 0); 16480#L12 assume !(1 == main_~i~0); 16479#L12-2 assume !(10 == main_~i~0); 16478#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16477#L18-1 assume !!(main_~i~0 > 0); 16476#L12 assume !(1 == main_~i~0); 16475#L12-2 assume !(10 == main_~i~0); 16474#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16473#L18-1 assume !!(main_~i~0 > 0); 16472#L12 assume !(1 == main_~i~0); 16471#L12-2 assume !(10 == main_~i~0); 16470#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16469#L18-1 assume !!(main_~i~0 > 0); 16468#L12 assume !(1 == main_~i~0); 16467#L12-2 assume !(10 == main_~i~0); 16466#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16465#L18-1 assume !!(main_~i~0 > 0); 16464#L12 assume !(1 == main_~i~0); 16463#L12-2 assume !(10 == main_~i~0); 16462#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16461#L18-1 assume !!(main_~i~0 > 0); 16460#L12 assume !(1 == main_~i~0); 16459#L12-2 assume !(10 == main_~i~0); 16458#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16457#L18-1 assume !!(main_~i~0 > 0); 16454#L12 assume !(1 == main_~i~0); 16456#L12-2 assume !(10 == main_~i~0); 16455#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16453#L18-1 assume !!(main_~i~0 > 0); 16452#L12 assume !(1 == main_~i~0); 16451#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 16446#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16447#L18-1 assume !!(main_~i~0 > 0); 16621#L12 assume !(1 == main_~i~0); 16620#L12-2 assume !(10 == main_~i~0); 16619#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16618#L18-1 assume !!(main_~i~0 > 0); 16616#L12 assume !(1 == main_~i~0); 16613#L12-2 assume !(10 == main_~i~0); 16610#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16607#L18-1 assume !!(main_~i~0 > 0); 16604#L12 assume !(1 == main_~i~0); 16601#L12-2 assume !(10 == main_~i~0); 16598#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16595#L18-1 assume !!(main_~i~0 > 0); 16592#L12 assume !(1 == main_~i~0); 16589#L12-2 assume !(10 == main_~i~0); 16586#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16583#L18-1 assume !!(main_~i~0 > 0); 16580#L12 assume !(1 == main_~i~0); 16577#L12-2 assume !(10 == main_~i~0); 16574#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16571#L18-1 assume !!(main_~i~0 > 0); 16568#L12 assume !(1 == main_~i~0); 16565#L12-2 assume !(10 == main_~i~0); 16562#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16559#L18-1 assume !!(main_~i~0 > 0); 16556#L12 assume !(1 == main_~i~0); 16553#L12-2 assume !(10 == main_~i~0); 16550#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16547#L18-1 assume !!(main_~i~0 > 0); 16544#L12 assume !(1 == main_~i~0); 16533#L12-2 assume !(10 == main_~i~0); 16540#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16537#L18-1 assume !!(main_~i~0 > 0); 16532#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16434#L12-2 [2019-11-16 00:03:58,176 INFO L793 eck$LassoCheckResult]: Loop: 16434#L12-2 assume !(10 == main_~i~0); 16435#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16527#L18-1 assume !!(main_~i~0 > 0); 16526#L12 assume !(1 == main_~i~0); 16525#L12-2 assume !(10 == main_~i~0); 16524#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16523#L18-1 assume !!(main_~i~0 > 0); 16522#L12 assume !(1 == main_~i~0); 16521#L12-2 assume !(10 == main_~i~0); 16520#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16519#L18-1 assume !!(main_~i~0 > 0); 16518#L12 assume !(1 == main_~i~0); 16517#L12-2 assume !(10 == main_~i~0); 16516#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16515#L18-1 assume !!(main_~i~0 > 0); 16514#L12 assume !(1 == main_~i~0); 16513#L12-2 assume !(10 == main_~i~0); 16512#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16511#L18-1 assume !!(main_~i~0 > 0); 16510#L12 assume !(1 == main_~i~0); 16509#L12-2 assume !(10 == main_~i~0); 16508#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16507#L18-1 assume !!(main_~i~0 > 0); 16506#L12 assume !(1 == main_~i~0); 16505#L12-2 assume !(10 == main_~i~0); 16504#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16503#L18-1 assume !!(main_~i~0 > 0); 16502#L12 assume !(1 == main_~i~0); 16501#L12-2 assume !(10 == main_~i~0); 16493#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16498#L18-1 assume !!(main_~i~0 > 0); 16495#L12 assume !(1 == main_~i~0); 16492#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 16449#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16450#L18-1 assume !!(main_~i~0 > 0); 16444#L12 assume !(1 == main_~i~0); 16445#L12-2 assume !(10 == main_~i~0); 16491#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16617#L18-1 assume !!(main_~i~0 > 0); 16615#L12 assume !(1 == main_~i~0); 16612#L12-2 assume !(10 == main_~i~0); 16609#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16606#L18-1 assume !!(main_~i~0 > 0); 16603#L12 assume !(1 == main_~i~0); 16600#L12-2 assume !(10 == main_~i~0); 16597#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16594#L18-1 assume !!(main_~i~0 > 0); 16591#L12 assume !(1 == main_~i~0); 16588#L12-2 assume !(10 == main_~i~0); 16585#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16582#L18-1 assume !!(main_~i~0 > 0); 16579#L12 assume !(1 == main_~i~0); 16576#L12-2 assume !(10 == main_~i~0); 16573#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16570#L18-1 assume !!(main_~i~0 > 0); 16567#L12 assume !(1 == main_~i~0); 16564#L12-2 assume !(10 == main_~i~0); 16561#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16558#L18-1 assume !!(main_~i~0 > 0); 16555#L12 assume !(1 == main_~i~0); 16552#L12-2 assume !(10 == main_~i~0); 16549#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16546#L18-1 assume !!(main_~i~0 > 0); 16543#L12 assume !(1 == main_~i~0); 16531#L12-2 assume !(10 == main_~i~0); 16539#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16536#L18-1 assume !!(main_~i~0 > 0); 16530#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16434#L12-2 [2019-11-16 00:03:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1278125010, now seen corresponding path program 15 times [2019-11-16 00:03:58,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:58,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100479849] [2019-11-16 00:03:58,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:58,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:58,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 322 proven. 120 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:58,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100479849] [2019-11-16 00:03:58,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746647521] [2019-11-16 00:03:58,271 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:58,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-11-16 00:03:58,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:03:58,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:03:58,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 322 proven. 226 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-16 00:03:58,384 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:58,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-16 00:03:58,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472262687] [2019-11-16 00:03:58,385 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:58,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:58,385 INFO L82 PathProgramCache]: Analyzing trace with hash -976981044, now seen corresponding path program 15 times [2019-11-16 00:03:58,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:58,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382319378] [2019-11-16 00:03:58,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:58,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:58,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:58,398 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:58,724 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 63 [2019-11-16 00:03:58,733 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:58,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:58,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:58,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:58,734 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:03:58,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:58,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:58,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:58,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration22_Loop [2019-11-16 00:03:58,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:58,734 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:58,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:58,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:58,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:58,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:58,780 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:58,780 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:58,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:58,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:58,786 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:58,786 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:58,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:58,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:58,793 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:58,793 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_22=0} Honda state: {v_rep~unnamed0~0~false_22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:58,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:58,798 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:58,800 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:03:58,801 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_22=1} Honda state: {v_rep~unnamed0~0~true_22=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:58,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:03:58,805 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/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:03:58,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:03:58,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:03:58,815 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:03:58,816 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:58,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:58,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:58,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:58,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:58,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:58,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:58,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:58,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration22_Loop [2019-11-16 00:03:58,817 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:58,817 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:58,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:58,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:58,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:58,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:58,869 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:58,869 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:58,869 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:03:58,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:58,870 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:58,870 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:58,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:58,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:58,870 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:58,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:58,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:58,871 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:03:58,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:58,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:58,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:58,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:58,872 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:58,872 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:58,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:58,873 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:03:58,874 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:58,874 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:58,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:58,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:58,874 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:58,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:58,875 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:58,876 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:58,877 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:58,877 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:58,877 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:58,878 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:03:58,878 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:58,878 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:58,878 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:03:58,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:58,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:58,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:58,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:03:58,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:03:59,029 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2019-11-16 00:03:59,029 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 212 states and 245 transitions. cyclomatic complexity: 39 Second operand 12 states. [2019-11-16 00:03:59,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 212 states and 245 transitions. cyclomatic complexity: 39. Second operand 12 states. Result 1146 states and 1366 transitions. Complement of second has 39 states. [2019-11-16 00:03:59,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:03:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2019-11-16 00:03:59,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 71 letters. Loop has 68 letters. [2019-11-16 00:03:59,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:59,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 139 letters. Loop has 68 letters. [2019-11-16 00:03:59,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:59,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 71 letters. Loop has 136 letters. [2019-11-16 00:03:59,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:59,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1146 states and 1366 transitions. [2019-11-16 00:03:59,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2019-11-16 00:03:59,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1146 states to 829 states and 976 transitions. [2019-11-16 00:03:59,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-11-16 00:03:59,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2019-11-16 00:03:59,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 829 states and 976 transitions. [2019-11-16 00:03:59,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:59,528 INFO L688 BuchiCegarLoop]: Abstraction has 829 states and 976 transitions. [2019-11-16 00:03:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states and 976 transitions. [2019-11-16 00:03:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 745. [2019-11-16 00:03:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-16 00:03:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 890 transitions. [2019-11-16 00:03:59,540 INFO L711 BuchiCegarLoop]: Abstraction has 745 states and 890 transitions. [2019-11-16 00:03:59,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:03:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:03:59,540 INFO L87 Difference]: Start difference. First operand 745 states and 890 transitions. Second operand 12 states. [2019-11-16 00:03:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:59,601 INFO L93 Difference]: Finished difference Result 295 states and 328 transitions. [2019-11-16 00:03:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:03:59,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 328 transitions. [2019-11-16 00:03:59,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2019-11-16 00:03:59,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 231 states and 264 transitions. [2019-11-16 00:03:59,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-16 00:03:59,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-11-16 00:03:59,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 264 transitions. [2019-11-16 00:03:59,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:59,605 INFO L688 BuchiCegarLoop]: Abstraction has 231 states and 264 transitions. [2019-11-16 00:03:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 264 transitions. [2019-11-16 00:03:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2019-11-16 00:03:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-16 00:03:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 257 transitions. [2019-11-16 00:03:59,608 INFO L711 BuchiCegarLoop]: Abstraction has 224 states and 257 transitions. [2019-11-16 00:03:59,608 INFO L591 BuchiCegarLoop]: Abstraction has 224 states and 257 transitions. [2019-11-16 00:03:59,608 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-16 00:03:59,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 257 transitions. [2019-11-16 00:03:59,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2019-11-16 00:03:59,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:59,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:59,610 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 2, 1, 1] [2019-11-16 00:03:59,610 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2019-11-16 00:03:59,610 INFO L791 eck$LassoCheckResult]: Stem: 19560#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 19561#L18-1 assume !!(main_~i~0 > 0); 19610#L12 assume 1 == main_~i~0;main_~up~0 := 1; 19609#L12-2 assume !(10 == main_~i~0); 19608#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19607#L18-1 assume !!(main_~i~0 > 0); 19606#L12 assume !(1 == main_~i~0); 19605#L12-2 assume !(10 == main_~i~0); 19604#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19603#L18-1 assume !!(main_~i~0 > 0); 19602#L12 assume !(1 == main_~i~0); 19601#L12-2 assume !(10 == main_~i~0); 19600#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19599#L18-1 assume !!(main_~i~0 > 0); 19598#L12 assume !(1 == main_~i~0); 19597#L12-2 assume !(10 == main_~i~0); 19596#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19595#L18-1 assume !!(main_~i~0 > 0); 19594#L12 assume !(1 == main_~i~0); 19593#L12-2 assume !(10 == main_~i~0); 19592#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19591#L18-1 assume !!(main_~i~0 > 0); 19590#L12 assume !(1 == main_~i~0); 19589#L12-2 assume !(10 == main_~i~0); 19588#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19587#L18-1 assume !!(main_~i~0 > 0); 19586#L12 assume !(1 == main_~i~0); 19585#L12-2 assume !(10 == main_~i~0); 19584#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19583#L18-1 assume !!(main_~i~0 > 0); 19582#L12 assume !(1 == main_~i~0); 19581#L12-2 assume !(10 == main_~i~0); 19580#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19579#L18-1 assume !!(main_~i~0 > 0); 19576#L12 assume !(1 == main_~i~0); 19578#L12-2 assume !(10 == main_~i~0); 19577#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19575#L18-1 assume !!(main_~i~0 > 0); 19574#L12 assume !(1 == main_~i~0); 19573#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 19568#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19569#L18-1 assume !!(main_~i~0 > 0); 19751#L12 assume !(1 == main_~i~0); 19750#L12-2 assume !(10 == main_~i~0); 19749#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19748#L18-1 assume !!(main_~i~0 > 0); 19746#L12 assume !(1 == main_~i~0); 19743#L12-2 assume !(10 == main_~i~0); 19740#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19737#L18-1 assume !!(main_~i~0 > 0); 19734#L12 assume !(1 == main_~i~0); 19731#L12-2 assume !(10 == main_~i~0); 19728#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19725#L18-1 assume !!(main_~i~0 > 0); 19722#L12 assume !(1 == main_~i~0); 19719#L12-2 assume !(10 == main_~i~0); 19716#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19713#L18-1 assume !!(main_~i~0 > 0); 19710#L12 assume !(1 == main_~i~0); 19707#L12-2 assume !(10 == main_~i~0); 19704#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19701#L18-1 assume !!(main_~i~0 > 0); 19698#L12 assume !(1 == main_~i~0); 19695#L12-2 assume !(10 == main_~i~0); 19692#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19689#L18-1 assume !!(main_~i~0 > 0); 19686#L12 assume !(1 == main_~i~0); 19683#L12-2 assume !(10 == main_~i~0); 19680#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19677#L18-1 assume !!(main_~i~0 > 0); 19674#L12 assume !(1 == main_~i~0); 19663#L12-2 assume !(10 == main_~i~0); 19670#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19667#L18-1 assume !!(main_~i~0 > 0); 19662#L12 assume 1 == main_~i~0;main_~up~0 := 1; 19556#L12-2 [2019-11-16 00:03:59,611 INFO L793 eck$LassoCheckResult]: Loop: 19556#L12-2 assume !(10 == main_~i~0); 19557#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19657#L18-1 assume !!(main_~i~0 > 0); 19656#L12 assume !(1 == main_~i~0); 19655#L12-2 assume !(10 == main_~i~0); 19654#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19653#L18-1 assume !!(main_~i~0 > 0); 19652#L12 assume !(1 == main_~i~0); 19651#L12-2 assume !(10 == main_~i~0); 19650#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19649#L18-1 assume !!(main_~i~0 > 0); 19648#L12 assume !(1 == main_~i~0); 19647#L12-2 assume !(10 == main_~i~0); 19646#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19645#L18-1 assume !!(main_~i~0 > 0); 19644#L12 assume !(1 == main_~i~0); 19643#L12-2 assume !(10 == main_~i~0); 19642#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19641#L18-1 assume !!(main_~i~0 > 0); 19640#L12 assume !(1 == main_~i~0); 19639#L12-2 assume !(10 == main_~i~0); 19638#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19637#L18-1 assume !!(main_~i~0 > 0); 19636#L12 assume !(1 == main_~i~0); 19635#L12-2 assume !(10 == main_~i~0); 19634#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19633#L18-1 assume !!(main_~i~0 > 0); 19632#L12 assume !(1 == main_~i~0); 19631#L12-2 assume !(10 == main_~i~0); 19630#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19629#L18-1 assume !!(main_~i~0 > 0); 19628#L12 assume !(1 == main_~i~0); 19627#L12-2 assume !(10 == main_~i~0); 19625#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19623#L18-1 assume !!(main_~i~0 > 0); 19618#L12 assume !(1 == main_~i~0); 19619#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 19571#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19572#L18-1 assume !!(main_~i~0 > 0); 19566#L12 assume !(1 == main_~i~0); 19567#L12-2 assume !(10 == main_~i~0); 19617#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19747#L18-1 assume !!(main_~i~0 > 0); 19745#L12 assume !(1 == main_~i~0); 19742#L12-2 assume !(10 == main_~i~0); 19739#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19736#L18-1 assume !!(main_~i~0 > 0); 19733#L12 assume !(1 == main_~i~0); 19730#L12-2 assume !(10 == main_~i~0); 19727#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19724#L18-1 assume !!(main_~i~0 > 0); 19721#L12 assume !(1 == main_~i~0); 19718#L12-2 assume !(10 == main_~i~0); 19715#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19712#L18-1 assume !!(main_~i~0 > 0); 19709#L12 assume !(1 == main_~i~0); 19706#L12-2 assume !(10 == main_~i~0); 19703#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19700#L18-1 assume !!(main_~i~0 > 0); 19697#L12 assume !(1 == main_~i~0); 19694#L12-2 assume !(10 == main_~i~0); 19691#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19688#L18-1 assume !!(main_~i~0 > 0); 19685#L12 assume !(1 == main_~i~0); 19682#L12-2 assume !(10 == main_~i~0); 19679#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19676#L18-1 assume !!(main_~i~0 > 0); 19673#L12 assume !(1 == main_~i~0); 19661#L12-2 assume !(10 == main_~i~0); 19669#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19666#L18-1 assume !!(main_~i~0 > 0); 19660#L12 assume 1 == main_~i~0;main_~up~0 := 1; 19556#L12-2 [2019-11-16 00:03:59,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1439876841, now seen corresponding path program 16 times [2019-11-16 00:03:59,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:59,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759639039] [2019-11-16 00:03:59,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:59,625 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash -680570443, now seen corresponding path program 16 times [2019-11-16 00:03:59,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:59,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404022141] [2019-11-16 00:03:59,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:59,653 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:59,654 INFO L82 PathProgramCache]: Analyzing trace with hash -569285429, now seen corresponding path program 17 times [2019-11-16 00:03:59,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:59,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706599355] [2019-11-16 00:03:59,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:59,679 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:00,034 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 66 [2019-11-16 00:04:00,372 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 69 [2019-11-16 00:04:00,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:04:00 BoogieIcfgContainer [2019-11-16 00:04:00,404 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:04:00,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:04:00,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:04:00,405 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:04:00,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:44" (3/4) ... [2019-11-16 00:04:00,408 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-16 00:04:00,472 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6d0727a5-82af-4b62-9ecf-459131b99abb/bin/uautomizer/witness.graphml [2019-11-16 00:04:00,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:04:00,474 INFO L168 Benchmark]: Toolchain (without parser) took 16547.25 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 463.5 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -389.0 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:00,474 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:04:00,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -217.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:00,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.85 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:04:00,475 INFO L168 Benchmark]: Boogie Preprocessor took 21.96 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:04:00,475 INFO L168 Benchmark]: RCFGBuilder took 269.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:00,476 INFO L168 Benchmark]: BuchiAutomizer took 15747.68 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 285.7 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -202.1 MB). Peak memory consumption was 496.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:00,476 INFO L168 Benchmark]: Witness Printer took 67.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:00,478 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -217.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.85 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 21.96 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 269.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15747.68 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 285.7 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -202.1 MB). Peak memory consumption was 496.0 MB. Max. memory is 11.5 GB. * Witness Printer took 67.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. 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 31 terminating modules (20 trivial, 11 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 10 locations. One deterministic module has affine ranking function i and consists of 12 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 16 locations. One deterministic module has affine ranking function i and consists of 18 locations. One deterministic module has affine ranking function i and consists of 20 locations. 20 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 224 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.6s and 23 iterations. TraceHistogramMax:19. Analysis of lassos took 10.1s. Construction of modules took 1.6s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 29. Automata minimization 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 585 StatesRemovedByMinimization, 28 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 224 states and ocurred in iteration 22. Nontrivial modules had stage [11, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 952/2604 HoareTripleCheckerStatistics: 204 SDtfs, 627 SDslu, 6 SDs, 0 SdLazy, 1859 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc0 concLT1 SILN0 SILU0 SILI9 SILT8 lasso1 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax180 hnf100 lsp35 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq198 hnf89 smp97 dnf110 smp98 tf111 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 207ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 32 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67f1420e=0, \result=0, i=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 Loop: [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...