./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c -s /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-15 21:27:36,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:27:36,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:27:36,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:27:36,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:27:36,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:27:36,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:27:36,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:27:36,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:27:36,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:27:36,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:27:36,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:27:36,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:27:36,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:27:36,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:27:36,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:27:36,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:27:36,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:27:36,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:27:36,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:27:36,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:27:36,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:27:36,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:27:36,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:27:36,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:27:36,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:27:36,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:27:36,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:27:36,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:27:36,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:27:36,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:27:36,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:27:36,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:27:36,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:27:36,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:27:36,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:27:36,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:27:36,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:27:36,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:27:36,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:27:36,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:27:36,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:27:36,743 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:27:36,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:27:36,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:27:36,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:27:36,745 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:27:36,745 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:27:36,745 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:27:36,745 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:27:36,745 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:27:36,746 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:27:36,746 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:27:36,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:27:36,746 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:27:36,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:27:36,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:27:36,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:27:36,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:27:36,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:27:36,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:27:36,748 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:27:36,748 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:27:36,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:27:36,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:27:36,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:27:36,749 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:27:36,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:27:36,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:27:36,750 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:27:36,751 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:27:36,751 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_973e82af-6787-4a52-b33d-c34e873ddff2/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 -> 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 [2019-11-15 21:27:36,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:27:36,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:27:36,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:27:36,791 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:27:36,791 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:27:36,792 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2019-11-15 21:27:36,848 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/data/0fb8151a8/f6568b1bb2604103afdd0ec885c308e1/FLAG3863ed712 [2019-11-15 21:27:37,272 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:27:37,273 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2019-11-15 21:27:37,277 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/data/0fb8151a8/f6568b1bb2604103afdd0ec885c308e1/FLAG3863ed712 [2019-11-15 21:27:37,289 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/data/0fb8151a8/f6568b1bb2604103afdd0ec885c308e1 [2019-11-15 21:27:37,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:27:37,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:27:37,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:27:37,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:27:37,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:27:37,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d53c513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37, skipping insertion in model container [2019-11-15 21:27:37,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,307 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:27:37,321 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:27:37,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:27:37,450 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:27:37,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:27:37,539 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:27:37,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37 WrapperNode [2019-11-15 21:27:37,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:27:37,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:27:37,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:27:37,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:27:37,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:27:37,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:27:37,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:27:37,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:27:37,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... [2019-11-15 21:27:37,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:27:37,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:27:37,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:27:37,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:27:37,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:27:37,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:27:37,794 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:27:37,795 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:27:37,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:27:37 BoogieIcfgContainer [2019-11-15 21:27:37,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:27:37,797 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:27:37,797 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:27:37,800 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:27:37,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:27:37,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:27:37" (1/3) ... [2019-11-15 21:27:37,803 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@781d83b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:27:37, skipping insertion in model container [2019-11-15 21:27:37,803 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:27:37,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:37" (2/3) ... [2019-11-15 21:27:37,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@781d83b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:27:37, skipping insertion in model container [2019-11-15 21:27:37,804 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:27:37,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:27:37" (3/3) ... [2019-11-15 21:27:37,806 INFO L371 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2019-11-15 21:27:37,858 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:27:37,858 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:27:37,859 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:27:37,859 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:27:37,859 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:27:37,859 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:27:37,859 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:27:37,859 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:27:37,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-15 21:27:37,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:27:37,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:37,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:37,896 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:27:37,896 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:27:37,896 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:27:37,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-15 21:27:37,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:27:37,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:37,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:37,898 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:27:37,898 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:27:37,905 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-15 21:27:37,906 INFO L793 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6#L12true assume main_~i~0 >= 10;main_~up~0 := 0; 3#L12-2true assume main_~i~0 <= 0;main_~up~0 := 1; 9#L15-1true assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2019-11-15 21:27:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 21:27:37,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:37,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159263473] [2019-11-15 21:27:37,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:37,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:37,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:37,988 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2019-11-15 21:27:37,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:37,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069044730] [2019-11-15 21:27:37,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:37,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:37,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:38,039 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-15 21:27:38,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069044730] [2019-11-15 21:27:38,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:38,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:27:38,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332045975] [2019-11-15 21:27:38,045 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:38,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:27:38,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:27:38,061 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-11-15 21:27:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:38,135 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-11-15 21:27:38,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:27:38,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-11-15 21:27:38,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:27:38,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 13 transitions. [2019-11-15 21:27:38,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:27:38,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:27:38,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-11-15 21:27:38,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:27:38,167 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-15 21:27:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-11-15 21:27:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-15 21:27:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 21:27:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-11-15 21:27:38,205 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-15 21:27:38,205 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-15 21:27:38,205 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:27:38,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2019-11-15 21:27:38,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:27:38,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:38,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:38,207 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:27:38,207 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:27:38,207 INFO L791 eck$LassoCheckResult]: Stem: 37#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; 38#L18-1 [2019-11-15 21:27:38,207 INFO L793 eck$LassoCheckResult]: Loop: 38#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 43#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 35#L12-2 assume !(main_~i~0 <= 0); 36#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 38#L18-1 [2019-11-15 21:27:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,207 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-15 21:27:38,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:38,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122304877] [2019-11-15 21:27:38,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,215 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2019-11-15 21:27:38,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:38,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790365280] [2019-11-15 21:27:38,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,232 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2019-11-15 21:27:38,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:38,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913872915] [2019-11-15 21:27:38,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,247 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:38,312 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:38,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:38,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:38,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:38,313 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:38,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:38,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:38,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:38,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2019-11-15 21:27:38,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:38,313 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:38,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,432 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:38,432 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:38,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:38,439 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-15 21:27:38,450 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:38,450 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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:38,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:38,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:38,460 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:38,460 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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:38,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:38,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:38,475 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:38,476 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_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:38,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:38,486 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_973e82af-6787-4a52-b33d-c34e873ddff2/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) [2019-11-15 21:27:38,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:38,508 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:38,517 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:38,519 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:38,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:38,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:38,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:38,519 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:38,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:38,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:38,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:38,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2019-11-15 21:27:38,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:38,520 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:38,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,609 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:38,614 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:38,615 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-15 21:27:38,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:38,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:38,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:38,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:38,627 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:38,627 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:38,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:38,654 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-15 21:27:38,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:38,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:38,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:38,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:38,658 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:38,658 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:38,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:38,679 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-15 21:27:38,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:38,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:38,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:38,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:38,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:38,682 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:38,682 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:38,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:38,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:27:38,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:38,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:38,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:38,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:38,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:38,687 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:38,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:38,695 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:38,699 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:38,700 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:27:38,702 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:38,702 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:38,702 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:38,703 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-15 21:27:38,705 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:38,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:38,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:38,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:38,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:38,763 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-15 21:27:38,766 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-15 21:27:38,767 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 21:27:38,811 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 31 transitions. Complement of second has 5 states. [2019-11-15 21:27:38,811 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-15 21:27:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:27:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-15 21:27:38,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-15 21:27:38,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:38,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:27:38,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:38,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2019-11-15 21:27:38,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:38,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 31 transitions. [2019-11-15 21:27:38,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:27:38,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 31 transitions. [2019-11-15 21:27:38,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 21:27:38,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 21:27:38,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2019-11-15 21:27:38,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:38,818 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-11-15 21:27:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2019-11-15 21:27:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-15 21:27:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 21:27:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2019-11-15 21:27:38,821 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-11-15 21:27:38,821 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-11-15 21:27:38,821 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:27:38,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2019-11-15 21:27:38,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:27:38,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:38,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:38,823 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:27:38,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:27:38,823 INFO L791 eck$LassoCheckResult]: Stem: 105#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; 106#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 110#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 112#L12-2 assume !(main_~i~0 <= 0); 120#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2019-11-15 21:27:38,824 INFO L793 eck$LassoCheckResult]: Loop: 107#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 108#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 117#L12-2 assume !(main_~i~0 <= 0); 118#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2019-11-15 21:27:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,824 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2019-11-15 21:27:38,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:38,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424669414] [2019-11-15 21:27:38,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:38,838 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-15 21:27:38,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424669414] [2019-11-15 21:27:38,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:38,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:27:38,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100509204] [2019-11-15 21:27:38,839 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2019-11-15 21:27:38,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:38,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030900731] [2019-11-15 21:27:38,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:38,852 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-15 21:27:38,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030900731] [2019-11-15 21:27:38,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:38,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:27:38,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061158453] [2019-11-15 21:27:38,853 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:38,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:38,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:27:38,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:27:38,853 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 21:27:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:38,864 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2019-11-15 21:27:38,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:27:38,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2019-11-15 21:27:38,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 21:27:38,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 30 transitions. [2019-11-15 21:27:38,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 21:27:38,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 21:27:38,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-11-15 21:27:38,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:38,868 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 21:27:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-11-15 21:27:38,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-15 21:27:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 21:27:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-11-15 21:27:38,870 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-11-15 21:27:38,870 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-11-15 21:27:38,870 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:27:38,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2019-11-15 21:27:38,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 21:27:38,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:38,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:38,871 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:27:38,871 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:27:38,871 INFO L791 eck$LassoCheckResult]: Stem: 156#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; 157#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 161#L12 assume !(main_~i~0 >= 10); 169#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 165#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2019-11-15 21:27:38,871 INFO L793 eck$LassoCheckResult]: Loop: 166#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 170#L12 assume !(main_~i~0 >= 10); 168#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 167#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2019-11-15 21:27:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,871 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 1 times [2019-11-15 21:27:38,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:38,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639947957] [2019-11-15 21:27:38,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,880 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2019-11-15 21:27:38,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:38,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179090437] [2019-11-15 21:27:38,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,889 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash -760725642, now seen corresponding path program 2 times [2019-11-15 21:27:38,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:38,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796631173] [2019-11-15 21:27:38,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:38,917 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-15 21:27:38,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796631173] [2019-11-15 21:27:38,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:38,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:27:38,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289584065] [2019-11-15 21:27:38,954 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:38,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:38,954 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:38,954 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:38,954 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:38,954 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:38,954 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:38,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:38,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2019-11-15 21:27:38,955 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:38,955 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:38,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:38,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,038 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:39,039 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:39,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:39,055 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-15 21:27:39,060 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:39,060 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_973e82af-6787-4a52-b33d-c34e873ddff2/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) [2019-11-15 21:27:39,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:39,074 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:39,079 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:39,079 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_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:39,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:39,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:39,091 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:39,091 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_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:39,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:39,106 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:39,131 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:39,131 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-15 21:27:39,138 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:39,140 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:39,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:39,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:39,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:39,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:39,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:39,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:39,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:39,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2019-11-15 21:27:39,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:39,141 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:39,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,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-15 21:27:39,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-15 21:27:39,225 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:39,226 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:39,226 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-15 21:27:39,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:39,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:39,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:39,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:39,229 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:39,229 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:39,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:39,233 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-15 21:27:39,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:39,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:39,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:39,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:39,235 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:39,236 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:39,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:39,241 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-15 21:27:39,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:39,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:39,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:39,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:39,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:39,243 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:39,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:39,246 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:39,249 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:39,249 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:39,250 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:39,250 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:39,250 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:39,250 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-11-15 21:27:39,251 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:39,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:39,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:39,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:39,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:39,293 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-15 21:27:39,293 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-15 21:27:39,293 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 21:27:39,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 36 states and 52 transitions. Complement of second has 7 states. [2019-11-15 21:27:39,336 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-15 21:27:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:27:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 21:27:39,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:27:39,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:39,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 21:27:39,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:39,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 21:27:39,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:39,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 52 transitions. [2019-11-15 21:27:39,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 21:27:39,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 50 transitions. [2019-11-15 21:27:39,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 21:27:39,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 21:27:39,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2019-11-15 21:27:39,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:39,342 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-11-15 21:27:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2019-11-15 21:27:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-15 21:27:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 21:27:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. [2019-11-15 21:27:39,351 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2019-11-15 21:27:39,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:39,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:27:39,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:27:39,352 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 4 states. [2019-11-15 21:27:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:39,386 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2019-11-15 21:27:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:27:39,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-11-15 21:27:39,389 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-11-15 21:27:39,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 40 transitions. [2019-11-15 21:27:39,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 21:27:39,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 21:27:39,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 40 transitions. [2019-11-15 21:27:39,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:39,390 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-11-15 21:27:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 40 transitions. [2019-11-15 21:27:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2019-11-15 21:27:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 21:27:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-11-15 21:27:39,392 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 21:27:39,393 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 21:27:39,393 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:27:39,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-11-15 21:27:39,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 21:27:39,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:39,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:39,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:27:39,397 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:27:39,398 INFO L791 eck$LassoCheckResult]: Stem: 326#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; 327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 331#L12 assume !(main_~i~0 >= 10); 338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 337#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2019-11-15 21:27:39,398 INFO L793 eck$LassoCheckResult]: Loop: 328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 329#L12 assume !(main_~i~0 >= 10); 322#L12-2 assume !(main_~i~0 <= 0); 323#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2019-11-15 21:27:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 3 times [2019-11-15 21:27:39,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:39,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574699880] [2019-11-15 21:27:39,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,426 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2019-11-15 21:27:39,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:39,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475932431] [2019-11-15 21:27:39,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,438 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:39,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash -760725580, now seen corresponding path program 1 times [2019-11-15 21:27:39,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:39,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885475010] [2019-11-15 21:27:39,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,459 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:39,487 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:39,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:39,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:39,488 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:39,488 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:39,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:39,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:39,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:39,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2019-11-15 21:27:39,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:39,489 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:39,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-15 21:27:39,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,558 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:39,558 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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) [2019-11-15 21:27:39,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:39,575 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:39,579 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:39,579 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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:39,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:39,594 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:39,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:39,602 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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:39,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:39,620 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:39,625 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:39,625 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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:39,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:39,643 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:39,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:39,662 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:39,668 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:39,671 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:39,671 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:39,671 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:39,671 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:39,671 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:39,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:39,672 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:39,672 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:39,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2019-11-15 21:27:39,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:39,672 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:39,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,742 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:39,742 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:39,742 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-15 21:27:39,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:39,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:39,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:39,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:39,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:39,744 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:39,744 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:39,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:39,745 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-15 21:27:39,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:39,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:39,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:39,746 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:39,747 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:39,747 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:39,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:39,757 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-15 21:27:39,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:39,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:39,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:39,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:39,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:39,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:39,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:39,768 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:39,772 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:39,773 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:39,774 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:39,774 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:39,774 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:39,775 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2019-11-15 21:27:39,775 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:39,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:39,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:39,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:39,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:39,816 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-15 21:27:39,816 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-15 21:27:39,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-15 21:27:39,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2019-11-15 21:27:39,851 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-15 21:27:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:27:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-15 21:27:39,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:27:39,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:39,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 21:27:39,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:39,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 21:27:39,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:39,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-11-15 21:27:39,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 21:27:39,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 40 transitions. [2019-11-15 21:27:39,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 21:27:39,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 21:27:39,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2019-11-15 21:27:39,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:39,855 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-15 21:27:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2019-11-15 21:27:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-11-15 21:27:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 21:27:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2019-11-15 21:27:39,861 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-11-15 21:27:39,861 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-11-15 21:27:39,861 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:27:39,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2019-11-15 21:27:39,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 21:27:39,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:39,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:39,866 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-11-15 21:27:39,866 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:27:39,866 INFO L791 eck$LassoCheckResult]: Stem: 427#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; 428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 440#L12 assume !(main_~i~0 >= 10); 443#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 442#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 441#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 433#L12 assume !(main_~i~0 >= 10); 423#L12-2 [2019-11-15 21:27:39,867 INFO L793 eck$LassoCheckResult]: Loop: 423#L12-2 assume !(main_~i~0 <= 0); 424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 434#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 447#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 423#L12-2 [2019-11-15 21:27:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:39,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918576, now seen corresponding path program 4 times [2019-11-15 21:27:39,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:39,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289762496] [2019-11-15 21:27:39,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,884 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2019-11-15 21:27:39,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:39,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115233319] [2019-11-15 21:27:39,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:39,901 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash -912839815, now seen corresponding path program 1 times [2019-11-15 21:27:39,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:39,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240707750] [2019-11-15 21:27:39,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:39,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:27:39,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240707750] [2019-11-15 21:27:39,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:39,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:27:39,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467762466] [2019-11-15 21:27:39,966 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:39,966 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:39,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:39,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:39,966 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:39,966 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:39,966 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:39,966 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:39,966 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2019-11-15 21:27:39,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:39,967 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:39,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:39,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,037 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:40,038 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:40,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:40,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:40,055 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:40,055 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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:40,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:40,066 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:40,074 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:40,074 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:40,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:40,082 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:40,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:40,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:40,204 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:40,205 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:40,205 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:40,205 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:40,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:40,206 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:40,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:40,206 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:40,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:40,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2019-11-15 21:27:40,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:40,206 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:40,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,288 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:40,289 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:40,289 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-15 21:27:40,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:40,290 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:40,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:40,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:40,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:40,291 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:40,291 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:40,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:40,292 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-15 21:27:40,292 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:40,293 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:40,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:40,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:40,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:40,294 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:40,294 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:40,297 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:40,303 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:40,303 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:27:40,303 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:40,304 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:40,304 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:40,304 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-15 21:27:40,304 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:40,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:40,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:40,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:40,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:40,378 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-15 21:27:40,378 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-15 21:27:40,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-15 21:27:40,441 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 39 states and 58 transitions. Complement of second has 7 states. [2019-11-15 21:27:40,443 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-15 21:27:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:27:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-15 21:27:40,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 21:27:40,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:40,444 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:27:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:40,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:40,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:40,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:40,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:40,507 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-15 21:27:40,508 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:27:40,508 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-15 21:27:40,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 77 states and 108 transitions. Complement of second has 9 states. [2019-11-15 21:27:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:27:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:27:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-15 21:27:40,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 21:27:40,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:40,562 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:27:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:40,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:40,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:40,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:40,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:40,612 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-15 21:27:40,613 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:27:40,613 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-15 21:27:40,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 53 states and 81 transitions. Complement of second has 8 states. [2019-11-15 21:27:40,646 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-15 21:27:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:27:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 21:27:40,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 21:27:40,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:40,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 21:27:40,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:40,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-15 21:27:40,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:40,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 81 transitions. [2019-11-15 21:27:40,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-15 21:27:40,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 42 states and 60 transitions. [2019-11-15 21:27:40,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 21:27:40,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 21:27:40,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 60 transitions. [2019-11-15 21:27:40,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:40,653 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-11-15 21:27:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 60 transitions. [2019-11-15 21:27:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-11-15 21:27:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 21:27:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-11-15 21:27:40,657 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-11-15 21:27:40,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:27:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:27:40,657 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 3 states. [2019-11-15 21:27:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:40,665 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2019-11-15 21:27:40,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:27:40,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-11-15 21:27:40,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 21:27:40,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 41 transitions. [2019-11-15 21:27:40,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 21:27:40,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 21:27:40,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2019-11-15 21:27:40,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:40,667 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-15 21:27:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2019-11-15 21:27:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-11-15 21:27:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 21:27:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-11-15 21:27:40,670 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-11-15 21:27:40,670 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-11-15 21:27:40,670 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:27:40,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 39 transitions. [2019-11-15 21:27:40,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 21:27:40,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:40,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:40,672 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-15 21:27:40,672 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:27:40,672 INFO L791 eck$LassoCheckResult]: Stem: 836#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; 837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 842#L12 assume !(main_~i~0 >= 10); 843#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 856#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 851#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2019-11-15 21:27:40,672 INFO L793 eck$LassoCheckResult]: Loop: 848#L12-2 assume !(main_~i~0 <= 0); 850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 847#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2019-11-15 21:27:40,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:40,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2019-11-15 21:27:40,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:40,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688466532] [2019-11-15 21:27:40,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:40,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:40,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:40,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688466532] [2019-11-15 21:27:40,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:40,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:27:40,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069492409] [2019-11-15 21:27:40,688 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2019-11-15 21:27:40,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:40,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319738044] [2019-11-15 21:27:40,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:40,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:40,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:40,694 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:40,730 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:40,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:40,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:40,730 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:40,730 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:40,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:40,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:40,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:40,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2019-11-15 21:27:40,730 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:40,731 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:40,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,793 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:40,793 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:40,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:40,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:40,807 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:40,807 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: [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:40,817 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:40,817 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:40,822 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:40,822 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:40,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:40,828 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:40,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:40,833 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:40,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:40,838 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:40,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:40,848 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-15 21:27:40,958 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:40,960 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:40,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:40,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:40,960 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:40,960 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:40,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:40,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:40,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:40,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2019-11-15 21:27:40,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:40,961 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:40,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:40,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:41,039 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:41,039 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:41,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:27:41,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:41,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:41,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:41,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:41,042 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:41,042 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:41,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:41,044 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-15 21:27:41,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:41,044 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:41,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:41,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:41,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:41,045 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:41,045 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:41,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:41,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:27:41,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:41,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:41,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:41,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:41,048 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:41,048 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:41,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:41,051 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-15 21:27:41,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:41,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:41,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:41,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:41,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:41,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:41,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:41,056 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:41,058 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:41,058 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:27:41,058 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:41,059 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:41,059 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:41,059 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-15 21:27:41,059 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,103 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-15 21:27:41,104 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-15 21:27:41,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 21:27:41,142 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 70 states and 94 transitions. Complement of second has 7 states. [2019-11-15 21:27:41,143 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-15 21:27:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:27:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 21:27:41,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 21:27:41,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:41,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 21:27:41,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:41,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-15 21:27:41,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:41,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. [2019-11-15 21:27:41,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 21:27:41,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 56 states and 74 transitions. [2019-11-15 21:27:41,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 21:27:41,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-15 21:27:41,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2019-11-15 21:27:41,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:41,147 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2019-11-15 21:27:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2019-11-15 21:27:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-11-15 21:27:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 21:27:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2019-11-15 21:27:41,151 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-11-15 21:27:41,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:27:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:27:41,152 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 4 states. [2019-11-15 21:27:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:41,170 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2019-11-15 21:27:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:27:41,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2019-11-15 21:27:41,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-15 21:27:41,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 54 states and 66 transitions. [2019-11-15 21:27:41,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-15 21:27:41,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 21:27:41,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2019-11-15 21:27:41,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:41,172 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-11-15 21:27:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2019-11-15 21:27:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-11-15 21:27:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 21:27:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-11-15 21:27:41,176 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-15 21:27:41,176 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-15 21:27:41,176 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:27:41,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2019-11-15 21:27:41,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-15 21:27:41,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:41,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:41,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2019-11-15 21:27:41,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:27:41,178 INFO L791 eck$LassoCheckResult]: Stem: 1092#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; 1093#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1112#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1113#L12-2 assume !(main_~i~0 <= 0); 1103#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1104#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1098#L12 assume !(main_~i~0 >= 10); 1099#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1106#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1094#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1095#L12 assume !(main_~i~0 >= 10); 1100#L12-2 assume !(main_~i~0 <= 0); 1105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1096#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1097#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2019-11-15 21:27:41,178 INFO L793 eck$LassoCheckResult]: Loop: 1107#L12-2 assume !(main_~i~0 <= 0); 1108#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1129#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1127#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2019-11-15 21:27:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:41,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1385122848, now seen corresponding path program 2 times [2019-11-15 21:27:41,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:41,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314211582] [2019-11-15 21:27:41,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:41,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:41,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:27:41,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314211582] [2019-11-15 21:27:41,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600714535] [2019-11-15 21:27:41,203 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:41,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:27:41,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:41,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:27:41,247 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:41,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:27:41,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062281259] [2019-11-15 21:27:41,248 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 4 times [2019-11-15 21:27:41,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:41,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853986523] [2019-11-15 21:27:41,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:41,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:41,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:41,254 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:41,285 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:41,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:41,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:41,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:41,285 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:41,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:41,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:41,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:41,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2019-11-15 21:27:41,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:41,285 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:41,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:41,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:41,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:41,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:41,352 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:41,352 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:41,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:41,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:41,358 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:41,358 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:41,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:41,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:41,366 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:41,366 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:41,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:41,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:41,374 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:41,374 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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:41,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:41,387 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:41,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:41,399 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:41,499 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:41,501 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:41,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:41,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:41,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:41,501 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:41,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:41,501 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:41,501 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:41,501 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2019-11-15 21:27:41,502 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:41,502 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:41,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:41,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:41,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:41,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:41,574 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:41,574 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:41,574 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-15 21:27:41,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:41,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:41,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:41,576 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:41,576 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:41,577 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:41,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:41,579 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-15 21:27:41,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:41,580 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:41,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:41,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:41,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:41,580 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:41,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:41,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:41,581 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-15 21:27:41,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:41,582 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:41,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:41,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:41,583 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:41,583 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:41,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:41,585 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-15 21:27:41,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:41,585 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:41,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:41,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:41,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:41,586 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:41,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:41,588 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:41,591 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:41,591 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:27:41,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:41,592 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:41,592 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:41,592 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-15 21:27:41,593 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:41,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,647 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-15 21:27:41,648 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-15 21:27:41,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-15 21:27:41,670 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 64 states and 82 transitions. Complement of second has 7 states. [2019-11-15 21:27:41,672 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-15 21:27:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:27:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 21:27:41,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 21:27:41,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:41,673 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:27:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,711 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-15 21:27:41,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:27:41,712 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-15 21:27:41,759 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 86 states and 103 transitions. Complement of second has 9 states. [2019-11-15 21:27:41,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:27:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:27:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-15 21:27:41,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 21:27:41,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:41,761 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:27:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,811 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-15 21:27:41,812 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:27:41,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-15 21:27:41,835 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 68 states and 87 transitions. Complement of second has 8 states. [2019-11-15 21:27:41,836 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-15 21:27:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:27:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 21:27:41,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 21:27:41,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:41,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-15 21:27:41,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:41,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 8 letters. [2019-11-15 21:27:41,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:41,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 87 transitions. [2019-11-15 21:27:41,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-15 21:27:41,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 63 transitions. [2019-11-15 21:27:41,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 21:27:41,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 21:27:41,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2019-11-15 21:27:41,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:41,840 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-15 21:27:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2019-11-15 21:27:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-11-15 21:27:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 21:27:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-15 21:27:41,843 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 21:27:41,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:27:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:27:41,843 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2019-11-15 21:27:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:41,865 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-15 21:27:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:27:41,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2019-11-15 21:27:41,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-15 21:27:41,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 49 transitions. [2019-11-15 21:27:41,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 21:27:41,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 21:27:41,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2019-11-15 21:27:41,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:41,868 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-11-15 21:27:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2019-11-15 21:27:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-11-15 21:27:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 21:27:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-15 21:27:41,870 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-15 21:27:41,871 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-15 21:27:41,871 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 21:27:41,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2019-11-15 21:27:41,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-15 21:27:41,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:41,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:41,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2019-11-15 21:27:41,872 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2019-11-15 21:27:41,872 INFO L791 eck$LassoCheckResult]: Stem: 1689#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; 1690#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1691#L12 assume !(main_~i~0 >= 10); 1694#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1696#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1697#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1713#L12 assume !(main_~i~0 >= 10); 1716#L12-2 assume !(main_~i~0 <= 0); 1715#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1712#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1702#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2019-11-15 21:27:41,872 INFO L793 eck$LassoCheckResult]: Loop: 1685#L12-2 assume !(main_~i~0 <= 0); 1686#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1698#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1719#L12 assume !(main_~i~0 >= 10); 1706#L12-2 assume !(main_~i~0 <= 0); 1711#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1704#L12 assume !(main_~i~0 >= 10); 1707#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1708#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1701#L12 assume !(main_~i~0 >= 10); 1699#L12-2 assume !(main_~i~0 <= 0); 1700#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1714#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2019-11-15 21:27:41,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:41,873 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2019-11-15 21:27:41,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:41,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489856194] [2019-11-15 21:27:41,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:41,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:41,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:41,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489856194] [2019-11-15 21:27:41,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548358752] [2019-11-15 21:27:41,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:41,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:41,947 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:41,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:27:41,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009407701] [2019-11-15 21:27:41,947 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:41,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:41,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1697726743, now seen corresponding path program 1 times [2019-11-15 21:27:41,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:41,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60663715] [2019-11-15 21:27:41,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:41,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:41,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:41,972 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-15 21:27:41,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60663715] [2019-11-15 21:27:41,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250085936] [2019-11-15 21:27:41,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:42,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:27:42,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:42,017 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-15 21:27:42,017 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:42,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:27:42,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770651152] [2019-11-15 21:27:42,023 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:42,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:42,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:27:42,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:27:42,024 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-15 21:27:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:42,054 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-11-15 21:27:42,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:27:42,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2019-11-15 21:27:42,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-15 21:27:42,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 56 transitions. [2019-11-15 21:27:42,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 21:27:42,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 21:27:42,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2019-11-15 21:27:42,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:42,057 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-11-15 21:27:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2019-11-15 21:27:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-11-15 21:27:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 21:27:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-15 21:27:42,060 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-15 21:27:42,060 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-15 21:27:42,060 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 21:27:42,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2019-11-15 21:27:42,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-15 21:27:42,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:42,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:42,061 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2019-11-15 21:27:42,061 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2019-11-15 21:27:42,061 INFO L791 eck$LassoCheckResult]: Stem: 1859#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; 1860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1876#L12 assume !(main_~i~0 >= 10); 1877#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1892#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1890#L12 assume !(main_~i~0 >= 10); 1896#L12-2 assume !(main_~i~0 <= 0); 1895#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1863#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1864#L12 assume !(main_~i~0 >= 10); 1857#L12-2 assume !(main_~i~0 <= 0); 1858#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1869#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1891#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2019-11-15 21:27:42,061 INFO L793 eck$LassoCheckResult]: Loop: 1855#L12-2 assume !(main_~i~0 <= 0); 1856#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1886#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1884#L12 assume !(main_~i~0 >= 10); 1875#L12-2 assume !(main_~i~0 <= 0); 1881#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1873#L12 assume !(main_~i~0 >= 10); 1870#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1871#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1862#L12 assume !(main_~i~0 >= 10); 1897#L12-2 assume !(main_~i~0 <= 0); 1867#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1865#L12 assume !(main_~i~0 >= 10); 1866#L12-2 assume !(main_~i~0 <= 0); 1872#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1893#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1894#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2019-11-15 21:27:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:42,062 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2019-11-15 21:27:42,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:42,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497140664] [2019-11-15 21:27:42,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:42,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497140664] [2019-11-15 21:27:42,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610610963] [2019-11-15 21:27:42,114 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:42,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:27:42,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:42,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:27:42,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:42,174 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:42,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-15 21:27:42,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676156094] [2019-11-15 21:27:42,175 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash 104414290, now seen corresponding path program 2 times [2019-11-15 21:27:42,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:42,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307194017] [2019-11-15 21:27:42,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:42,216 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-15 21:27:42,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307194017] [2019-11-15 21:27:42,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996875445] [2019-11-15 21:27:42,217 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:42,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:27:42,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:42,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:27:42,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:42,262 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-15 21:27:42,262 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:42,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-15 21:27:42,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47093151] [2019-11-15 21:27:42,263 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:42,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:42,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:42,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:42,263 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 6 states. [2019-11-15 21:27:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:42,288 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-15 21:27:42,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:27:42,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2019-11-15 21:27:42,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-15 21:27:42,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 64 transitions. [2019-11-15 21:27:42,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-15 21:27:42,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-15 21:27:42,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2019-11-15 21:27:42,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:42,290 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-11-15 21:27:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2019-11-15 21:27:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-11-15 21:27:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-15 21:27:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-11-15 21:27:42,293 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-15 21:27:42,294 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-15 21:27:42,294 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 21:27:42,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2019-11-15 21:27:42,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 21:27:42,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:42,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:42,295 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2019-11-15 21:27:42,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2019-11-15 21:27:42,296 INFO L791 eck$LassoCheckResult]: Stem: 2071#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; 2072#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2085#L12 assume !(main_~i~0 >= 10); 2086#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2101#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2098#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2099#L12 assume !(main_~i~0 >= 10); 2106#L12-2 assume !(main_~i~0 <= 0); 2107#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2111#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2109#L12 assume !(main_~i~0 >= 10); 2110#L12-2 assume !(main_~i~0 <= 0); 2079#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2075#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2076#L12 assume !(main_~i~0 >= 10); 2069#L12-2 assume !(main_~i~0 <= 0); 2070#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2102#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2100#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2019-11-15 21:27:42,296 INFO L793 eck$LassoCheckResult]: Loop: 2067#L12-2 assume !(main_~i~0 <= 0); 2068#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2095#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2093#L12 assume !(main_~i~0 >= 10); 2084#L12-2 assume !(main_~i~0 <= 0); 2090#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2087#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2082#L12 assume !(main_~i~0 >= 10); 2080#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2078#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2073#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2074#L12 assume !(main_~i~0 >= 10); 2077#L12-2 assume !(main_~i~0 <= 0); 2081#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2117#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2116#L12 assume !(main_~i~0 >= 10); 2115#L12-2 assume !(main_~i~0 <= 0); 2114#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2113#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2112#L12 assume !(main_~i~0 >= 10); 2108#L12-2 assume !(main_~i~0 <= 0); 2105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2103#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2104#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2019-11-15 21:27:42,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:42,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2019-11-15 21:27:42,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:42,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322014715] [2019-11-15 21:27:42,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:42,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322014715] [2019-11-15 21:27:42,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654871382] [2019-11-15 21:27:42,327 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:42,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 21:27:42,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:42,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:27:42,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:42,367 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:42,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-15 21:27:42,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918210198] [2019-11-15 21:27:42,369 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:42,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1813717701, now seen corresponding path program 3 times [2019-11-15 21:27:42,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:42,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762744366] [2019-11-15 21:27:42,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:42,415 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-15 21:27:42,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762744366] [2019-11-15 21:27:42,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275886669] [2019-11-15 21:27:42,416 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:42,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 21:27:42,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:42,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:27:42,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:42,463 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-15 21:27:42,464 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:42,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-15 21:27:42,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059838476] [2019-11-15 21:27:42,464 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:42,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:27:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:27:42,465 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-15 21:27:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:42,527 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-11-15 21:27:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:27:42,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2019-11-15 21:27:42,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2019-11-15 21:27:42,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 72 transitions. [2019-11-15 21:27:42,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 21:27:42,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 21:27:42,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2019-11-15 21:27:42,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:42,531 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-11-15 21:27:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2019-11-15 21:27:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2019-11-15 21:27:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-15 21:27:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-11-15 21:27:42,538 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-11-15 21:27:42,538 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-11-15 21:27:42,538 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 21:27:42,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2019-11-15 21:27:42,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-15 21:27:42,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:42,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:42,546 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2019-11-15 21:27:42,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2019-11-15 21:27:42,547 INFO L791 eck$LassoCheckResult]: Stem: 2325#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; 2326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2337#L12 assume !(main_~i~0 >= 10); 2338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2356#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2354#L12 assume !(main_~i~0 >= 10); 2379#L12-2 assume !(main_~i~0 <= 0); 2378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2330#L12 assume !(main_~i~0 >= 10); 2323#L12-2 assume !(main_~i~0 <= 0); 2324#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2377#L12 assume !(main_~i~0 >= 10); 2376#L12-2 assume !(main_~i~0 <= 0); 2375#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2358#L12 assume !(main_~i~0 >= 10); 2363#L12-2 assume !(main_~i~0 <= 0); 2361#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2355#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2019-11-15 21:27:42,548 INFO L793 eck$LassoCheckResult]: Loop: 2321#L12-2 assume !(main_~i~0 <= 0); 2322#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2351#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2349#L12 assume !(main_~i~0 >= 10); 2341#L12-2 assume !(main_~i~0 <= 0); 2346#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2344#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2339#L12 assume !(main_~i~0 >= 10); 2335#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2336#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2328#L12 assume !(main_~i~0 >= 10); 2331#L12-2 assume !(main_~i~0 <= 0); 2332#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2373#L12 assume !(main_~i~0 >= 10); 2372#L12-2 assume !(main_~i~0 <= 0); 2371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2369#L12 assume !(main_~i~0 >= 10); 2368#L12-2 assume !(main_~i~0 <= 0); 2367#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2365#L12 assume !(main_~i~0 >= 10); 2364#L12-2 assume !(main_~i~0 <= 0); 2362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2360#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2019-11-15 21:27:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2019-11-15 21:27:42,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:42,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055100498] [2019-11-15 21:27:42,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:42,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055100498] [2019-11-15 21:27:42,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099708186] [2019-11-15 21:27:42,620 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:42,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:27:42,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:42,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:27:42,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:42,675 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:42,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-15 21:27:42,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973453926] [2019-11-15 21:27:42,676 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 798220708, now seen corresponding path program 4 times [2019-11-15 21:27:42,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:42,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961482702] [2019-11-15 21:27:42,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:42,739 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-15 21:27:42,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961482702] [2019-11-15 21:27:42,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165648330] [2019-11-15 21:27:42,740 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:42,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:27:42,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:42,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:27:42,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:42,814 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-15 21:27:42,815 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:42,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-15 21:27:42,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763657102] [2019-11-15 21:27:42,816 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:42,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:42,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:27:42,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:27:42,816 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-11-15 21:27:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:42,864 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-11-15 21:27:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:42,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2019-11-15 21:27:42,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-15 21:27:42,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 80 transitions. [2019-11-15 21:27:42,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-15 21:27:42,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-15 21:27:42,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2019-11-15 21:27:42,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:42,867 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-11-15 21:27:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2019-11-15 21:27:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2019-11-15 21:27:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 21:27:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-11-15 21:27:42,870 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-11-15 21:27:42,870 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-11-15 21:27:42,871 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 21:27:42,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2019-11-15 21:27:42,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-15 21:27:42,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:42,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:42,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2019-11-15 21:27:42,872 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2019-11-15 21:27:42,873 INFO L791 eck$LassoCheckResult]: Stem: 2621#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; 2622#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2633#L12 assume !(main_~i~0 >= 10); 2634#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2651#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2649#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2628#L12 assume !(main_~i~0 >= 10); 2619#L12-2 assume !(main_~i~0 <= 0); 2620#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2625#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2626#L12 assume !(main_~i~0 >= 10); 2683#L12-2 assume !(main_~i~0 <= 0); 2682#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2681#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2680#L12 assume !(main_~i~0 >= 10); 2679#L12-2 assume !(main_~i~0 <= 0); 2678#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2677#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2676#L12 assume !(main_~i~0 >= 10); 2675#L12-2 assume !(main_~i~0 <= 0); 2674#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2673#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2653#L12 assume !(main_~i~0 >= 10); 2658#L12-2 assume !(main_~i~0 <= 0); 2656#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2652#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2650#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2019-11-15 21:27:42,873 INFO L793 eck$LassoCheckResult]: Loop: 2617#L12-2 assume !(main_~i~0 <= 0); 2618#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2647#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2645#L12 assume !(main_~i~0 >= 10); 2637#L12-2 assume !(main_~i~0 <= 0); 2642#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2640#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2635#L12 assume !(main_~i~0 >= 10); 2631#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2632#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2623#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2624#L12 assume !(main_~i~0 >= 10); 2627#L12-2 assume !(main_~i~0 <= 0); 2629#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2630#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2672#L12 assume !(main_~i~0 >= 10); 2671#L12-2 assume !(main_~i~0 <= 0); 2670#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2669#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2668#L12 assume !(main_~i~0 >= 10); 2667#L12-2 assume !(main_~i~0 <= 0); 2666#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2665#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2664#L12 assume !(main_~i~0 >= 10); 2663#L12-2 assume !(main_~i~0 <= 0); 2662#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2661#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2660#L12 assume !(main_~i~0 >= 10); 2659#L12-2 assume !(main_~i~0 <= 0); 2657#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2654#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2655#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2019-11-15 21:27:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2019-11-15 21:27:42,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:42,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199478457] [2019-11-15 21:27:42,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:42,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199478457] [2019-11-15 21:27:42,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024253924] [2019-11-15 21:27:42,945 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:42,985 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-15 21:27:42,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:42,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:27:42,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:42,992 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:42,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-15 21:27:42,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153177040] [2019-11-15 21:27:42,993 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:42,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1712813683, now seen corresponding path program 5 times [2019-11-15 21:27:42,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:42,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583505733] [2019-11-15 21:27:42,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:42,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:43,052 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-15 21:27:43,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583505733] [2019-11-15 21:27:43,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515297530] [2019-11-15 21:27:43,053 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:43,110 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-15 21:27:43,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:43,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:27:43,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:43,129 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-15 21:27:43,130 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:43,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-15 21:27:43,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496469874] [2019-11-15 21:27:43,131 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:43,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:27:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:27:43,132 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-11-15 21:27:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:43,196 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2019-11-15 21:27:43,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:27:43,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2019-11-15 21:27:43,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2019-11-15 21:27:43,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 88 transitions. [2019-11-15 21:27:43,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-15 21:27:43,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-15 21:27:43,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2019-11-15 21:27:43,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:43,199 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-11-15 21:27:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2019-11-15 21:27:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2019-11-15 21:27:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 21:27:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-11-15 21:27:43,202 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-15 21:27:43,202 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-15 21:27:43,203 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 21:27:43,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 83 transitions. [2019-11-15 21:27:43,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2019-11-15 21:27:43,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:43,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:43,205 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2019-11-15 21:27:43,205 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2019-11-15 21:27:43,205 INFO L791 eck$LassoCheckResult]: Stem: 2959#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; 2960#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2975#L12 assume !(main_~i~0 >= 10); 2976#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2991#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2988#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2989#L12 assume !(main_~i~0 >= 10); 3029#L12-2 assume !(main_~i~0 <= 0); 3028#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2963#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2964#L12 assume !(main_~i~0 >= 10); 2957#L12-2 assume !(main_~i~0 <= 0); 2958#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2968#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3027#L12 assume !(main_~i~0 >= 10); 3026#L12-2 assume !(main_~i~0 <= 0); 3025#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3024#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3023#L12 assume !(main_~i~0 >= 10); 3022#L12-2 assume !(main_~i~0 <= 0); 3021#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3019#L12 assume !(main_~i~0 >= 10); 3018#L12-2 assume !(main_~i~0 <= 0); 3017#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3016#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2995#L12 assume !(main_~i~0 >= 10); 2999#L12-2 assume !(main_~i~0 <= 0); 2997#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2994#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2990#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2019-11-15 21:27:43,206 INFO L793 eck$LassoCheckResult]: Loop: 2955#L12-2 assume !(main_~i~0 <= 0); 2956#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2985#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2983#L12 assume !(main_~i~0 >= 10); 2974#L12-2 assume !(main_~i~0 <= 0); 2980#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2977#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2972#L12 assume !(main_~i~0 >= 10); 2969#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2966#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2967#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3015#L12 assume !(main_~i~0 >= 10); 2970#L12-2 assume !(main_~i~0 <= 0); 2971#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2962#L12 assume !(main_~i~0 >= 10); 2965#L12-2 assume !(main_~i~0 <= 0); 3014#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3013#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3012#L12 assume !(main_~i~0 >= 10); 3011#L12-2 assume !(main_~i~0 <= 0); 3010#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3009#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3008#L12 assume !(main_~i~0 >= 10); 3007#L12-2 assume !(main_~i~0 <= 0); 3006#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3005#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3004#L12 assume !(main_~i~0 >= 10); 3003#L12-2 assume !(main_~i~0 <= 0); 3002#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3001#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3000#L12 assume !(main_~i~0 >= 10); 2998#L12-2 assume !(main_~i~0 <= 0); 2996#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2992#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2993#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2019-11-15 21:27:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:43,206 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2019-11-15 21:27:43,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:43,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631471970] [2019-11-15 21:27:43,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:43,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631471970] [2019-11-15 21:27:43,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181958895] [2019-11-15 21:27:43,298 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:43,349 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-15 21:27:43,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:43,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:27:43,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:43,357 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:43,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-15 21:27:43,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252152433] [2019-11-15 21:27:43,358 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:43,358 INFO L82 PathProgramCache]: Analyzing trace with hash -127593226, now seen corresponding path program 6 times [2019-11-15 21:27:43,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:43,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437711680] [2019-11-15 21:27:43,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:43,443 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-15 21:27:43,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437711680] [2019-11-15 21:27:43,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159563335] [2019-11-15 21:27:43,444 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:43,501 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-15 21:27:43,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:43,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:27:43,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:43,508 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-15 21:27:43,509 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:43,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-15 21:27:43,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069674000] [2019-11-15 21:27:43,509 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:43,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:27:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:27:43,510 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-15 21:27:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:43,592 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-11-15 21:27:43,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:27:43,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2019-11-15 21:27:43,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2019-11-15 21:27:43,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 96 transitions. [2019-11-15 21:27:43,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-15 21:27:43,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-15 21:27:43,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 96 transitions. [2019-11-15 21:27:43,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:43,594 INFO L688 BuchiCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-11-15 21:27:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 96 transitions. [2019-11-15 21:27:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-11-15 21:27:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-15 21:27:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2019-11-15 21:27:43,597 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-11-15 21:27:43,597 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-11-15 21:27:43,597 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 21:27:43,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 91 transitions. [2019-11-15 21:27:43,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-11-15 21:27:43,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:43,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:43,599 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2019-11-15 21:27:43,599 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2019-11-15 21:27:43,599 INFO L791 eck$LassoCheckResult]: Stem: 3339#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; 3340#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3352#L12 assume !(main_~i~0 >= 10); 3353#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3368#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3369#L12 assume !(main_~i~0 >= 10); 3417#L12-2 assume !(main_~i~0 <= 0); 3416#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3343#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3344#L12 assume !(main_~i~0 >= 10); 3337#L12-2 assume !(main_~i~0 <= 0); 3338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3348#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3415#L12 assume !(main_~i~0 >= 10); 3414#L12-2 assume !(main_~i~0 <= 0); 3413#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3411#L12 assume !(main_~i~0 >= 10); 3410#L12-2 assume !(main_~i~0 <= 0); 3409#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3407#L12 assume !(main_~i~0 >= 10); 3406#L12-2 assume !(main_~i~0 <= 0); 3405#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3404#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3403#L12 assume !(main_~i~0 >= 10); 3402#L12-2 assume !(main_~i~0 <= 0); 3401#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3400#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3375#L12 assume !(main_~i~0 >= 10); 3379#L12-2 assume !(main_~i~0 <= 0); 3377#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3370#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2019-11-15 21:27:43,600 INFO L793 eck$LassoCheckResult]: Loop: 3335#L12-2 assume !(main_~i~0 <= 0); 3336#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3364#L12 assume !(main_~i~0 >= 10); 3356#L12-2 assume !(main_~i~0 <= 0); 3361#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3354#L12 assume !(main_~i~0 >= 10); 3349#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3347#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3399#L12 assume !(main_~i~0 >= 10); 3350#L12-2 assume !(main_~i~0 <= 0); 3351#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3341#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3342#L12 assume !(main_~i~0 >= 10); 3345#L12-2 assume !(main_~i~0 <= 0); 3398#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3397#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3396#L12 assume !(main_~i~0 >= 10); 3395#L12-2 assume !(main_~i~0 <= 0); 3394#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3393#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3392#L12 assume !(main_~i~0 >= 10); 3391#L12-2 assume !(main_~i~0 <= 0); 3390#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3389#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3388#L12 assume !(main_~i~0 >= 10); 3387#L12-2 assume !(main_~i~0 <= 0); 3386#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3385#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3384#L12 assume !(main_~i~0 >= 10); 3383#L12-2 assume !(main_~i~0 <= 0); 3382#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3380#L12 assume !(main_~i~0 >= 10); 3378#L12-2 assume !(main_~i~0 <= 0); 3376#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3372#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3373#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2019-11-15 21:27:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:43,600 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2019-11-15 21:27:43,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:43,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078222517] [2019-11-15 21:27:43,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:43,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078222517] [2019-11-15 21:27:43,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123355403] [2019-11-15 21:27:43,678 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:43,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:27:43,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:43,737 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:43,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-15 21:27:43,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812244868] [2019-11-15 21:27:43,738 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:43,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:43,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1701561311, now seen corresponding path program 7 times [2019-11-15 21:27:43,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:43,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465215665] [2019-11-15 21:27:43,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:43,809 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-15 21:27:43,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465215665] [2019-11-15 21:27:43,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276348559] [2019-11-15 21:27:43,810 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:43,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:27:43,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:43,873 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-15 21:27:43,874 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:43,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-15 21:27:43,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472462068] [2019-11-15 21:27:43,874 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:43,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:43,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:27:43,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:27:43,875 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. cyclomatic complexity: 11 Second operand 11 states. [2019-11-15 21:27:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:43,950 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2019-11-15 21:27:43,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:27:43,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 105 transitions. [2019-11-15 21:27:43,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-15 21:27:43,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 104 transitions. [2019-11-15 21:27:43,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-11-15 21:27:43,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-11-15 21:27:43,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 104 transitions. [2019-11-15 21:27:43,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:43,952 INFO L688 BuchiCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-15 21:27:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 104 transitions. [2019-11-15 21:27:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-11-15 21:27:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 21:27:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-11-15 21:27:43,955 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-15 21:27:43,955 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-15 21:27:43,955 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-15 21:27:43,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2019-11-15 21:27:43,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2019-11-15 21:27:43,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:43,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:43,957 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2019-11-15 21:27:43,957 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2019-11-15 21:27:43,957 INFO L791 eck$LassoCheckResult]: Stem: 3761#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; 3762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3776#L12 assume !(main_~i~0 >= 10); 3777#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3791#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3768#L12 assume !(main_~i~0 >= 10); 3759#L12-2 assume !(main_~i~0 <= 0); 3760#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3766#L12 assume !(main_~i~0 >= 10); 3847#L12-2 assume !(main_~i~0 <= 0); 3846#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3844#L12 assume !(main_~i~0 >= 10); 3843#L12-2 assume !(main_~i~0 <= 0); 3842#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3840#L12 assume !(main_~i~0 >= 10); 3839#L12-2 assume !(main_~i~0 <= 0); 3838#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3836#L12 assume !(main_~i~0 >= 10); 3835#L12-2 assume !(main_~i~0 <= 0); 3834#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3833#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3832#L12 assume !(main_~i~0 >= 10); 3831#L12-2 assume !(main_~i~0 <= 0); 3830#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3829#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3828#L12 assume !(main_~i~0 >= 10); 3827#L12-2 assume !(main_~i~0 <= 0); 3826#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3825#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3793#L12 assume !(main_~i~0 >= 10); 3798#L12-2 assume !(main_~i~0 <= 0); 3796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3792#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3790#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2019-11-15 21:27:43,958 INFO L793 eck$LassoCheckResult]: Loop: 3757#L12-2 assume !(main_~i~0 <= 0); 3758#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3784#L12 assume !(main_~i~0 >= 10); 3775#L12-2 assume !(main_~i~0 <= 0); 3781#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3773#L12 assume !(main_~i~0 >= 10); 3771#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3763#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3764#L12 assume !(main_~i~0 >= 10); 3767#L12-2 assume !(main_~i~0 <= 0); 3769#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3824#L12 assume !(main_~i~0 >= 10); 3823#L12-2 assume !(main_~i~0 <= 0); 3822#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3821#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3820#L12 assume !(main_~i~0 >= 10); 3819#L12-2 assume !(main_~i~0 <= 0); 3818#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3817#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3816#L12 assume !(main_~i~0 >= 10); 3815#L12-2 assume !(main_~i~0 <= 0); 3814#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3812#L12 assume !(main_~i~0 >= 10); 3811#L12-2 assume !(main_~i~0 <= 0); 3810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3809#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3808#L12 assume !(main_~i~0 >= 10); 3807#L12-2 assume !(main_~i~0 <= 0); 3806#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3804#L12 assume !(main_~i~0 >= 10); 3803#L12-2 assume !(main_~i~0 <= 0); 3802#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3801#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3800#L12 assume !(main_~i~0 >= 10); 3799#L12-2 assume !(main_~i~0 <= 0); 3797#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3795#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2019-11-15 21:27:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2019-11-15 21:27:43,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:43,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552570234] [2019-11-15 21:27:43,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:43,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:44,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552570234] [2019-11-15 21:27:44,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262326303] [2019-11-15 21:27:44,048 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:44,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:27:44,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:44,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 21:27:44,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:44,128 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:44,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-15 21:27:44,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349739653] [2019-11-15 21:27:44,129 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:27:44,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:44,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2143365560, now seen corresponding path program 8 times [2019-11-15 21:27:44,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:44,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992539926] [2019-11-15 21:27:44,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:44,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:44,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:27:44,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992539926] [2019-11-15 21:27:44,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643139685] [2019-11-15 21:27:44,228 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:44,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:27:44,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:44,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 21:27:44,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:27:44,297 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:44,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-15 21:27:44,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841455823] [2019-11-15 21:27:44,298 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:27:44,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:44,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:27:44,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:27:44,299 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 11 Second operand 12 states. [2019-11-15 21:27:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:44,422 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2019-11-15 21:27:44,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:27:44,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 215 transitions. [2019-11-15 21:27:44,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-15 21:27:44,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 190 states and 211 transitions. [2019-11-15 21:27:44,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-11-15 21:27:44,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2019-11-15 21:27:44,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 211 transitions. [2019-11-15 21:27:44,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:44,427 INFO L688 BuchiCegarLoop]: Abstraction has 190 states and 211 transitions. [2019-11-15 21:27:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 211 transitions. [2019-11-15 21:27:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2019-11-15 21:27:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 21:27:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2019-11-15 21:27:44,433 INFO L711 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-11-15 21:27:44,433 INFO L591 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-11-15 21:27:44,433 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-15 21:27:44,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 184 transitions. [2019-11-15 21:27:44,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:44,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:44,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:44,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-15 21:27:44,439 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2019-11-15 21:27:44,440 INFO L791 eck$LassoCheckResult]: Stem: 4314#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; 4315#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4317#L12 assume !(main_~i~0 >= 10); 4409#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4408#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4322#L12 assume !(main_~i~0 >= 10); 4323#L12-2 assume !(main_~i~0 <= 0); 4406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4319#L12 assume !(main_~i~0 >= 10); 4312#L12-2 assume !(main_~i~0 <= 0); 4313#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4405#L12 assume !(main_~i~0 >= 10); 4404#L12-2 assume !(main_~i~0 <= 0); 4403#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4402#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4401#L12 assume !(main_~i~0 >= 10); 4400#L12-2 assume !(main_~i~0 <= 0); 4399#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4397#L12 assume !(main_~i~0 >= 10); 4396#L12-2 assume !(main_~i~0 <= 0); 4395#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4393#L12 assume !(main_~i~0 >= 10); 4392#L12-2 assume !(main_~i~0 <= 0); 4391#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4389#L12 assume !(main_~i~0 >= 10); 4388#L12-2 assume !(main_~i~0 <= 0); 4387#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4385#L12 assume !(main_~i~0 >= 10); 4384#L12-2 assume !(main_~i~0 <= 0); 4383#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4339#L12 assume !(main_~i~0 >= 10); 4343#L12-2 assume !(main_~i~0 <= 0); 4341#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4332#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2019-11-15 21:27:44,440 INFO L793 eck$LassoCheckResult]: Loop: 4331#L12-2 assume !(main_~i~0 <= 0); 4326#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4333#L12 assume !(main_~i~0 >= 10); 4335#L12-2 assume !(main_~i~0 <= 0); 4472#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4412#L12 assume !(main_~i~0 >= 10); 4379#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4377#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4376#L12 assume !(main_~i~0 >= 10); 4375#L12-2 assume !(main_~i~0 <= 0); 4374#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4373#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4372#L12 assume !(main_~i~0 >= 10); 4371#L12-2 assume !(main_~i~0 <= 0); 4370#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4369#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4368#L12 assume !(main_~i~0 >= 10); 4367#L12-2 assume !(main_~i~0 <= 0); 4366#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4364#L12 assume !(main_~i~0 >= 10); 4363#L12-2 assume !(main_~i~0 <= 0); 4362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4360#L12 assume !(main_~i~0 >= 10); 4359#L12-2 assume !(main_~i~0 <= 0); 4358#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4356#L12 assume !(main_~i~0 >= 10); 4355#L12-2 assume !(main_~i~0 <= 0); 4354#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4352#L12 assume !(main_~i~0 >= 10); 4351#L12-2 assume !(main_~i~0 <= 0); 4350#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4348#L12 assume !(main_~i~0 >= 10); 4347#L12-2 assume !(main_~i~0 <= 0); 4346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4345#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4344#L12 assume !(main_~i~0 >= 10); 4342#L12-2 assume !(main_~i~0 <= 0); 4340#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4336#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4337#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2019-11-15 21:27:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:44,440 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2019-11-15 21:27:44,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:44,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939367605] [2019-11-15 21:27:44,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:44,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:44,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:44,467 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:44,467 INFO L82 PathProgramCache]: Analyzing trace with hash -50295759, now seen corresponding path program 9 times [2019-11-15 21:27:44,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:44,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743705857] [2019-11-15 21:27:44,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:44,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:44,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:44,486 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1470164625, now seen corresponding path program 3 times [2019-11-15 21:27:44,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:44,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907286411] [2019-11-15 21:27:44,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:44,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:44,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 591 proven. 6 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:44,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907286411] [2019-11-15 21:27:44,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551342512] [2019-11-15 21:27:44,527 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:44,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-11-15 21:27:44,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:44,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 21:27:44,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 752 proven. 10 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-15 21:27:44,690 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:44,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 13 [2019-11-15 21:27:44,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481961630] [2019-11-15 21:27:44,919 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2019-11-15 21:27:44,929 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:44,929 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:44,929 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:44,930 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:44,930 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:44,930 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:44,930 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:44,930 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:44,930 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration17_Loop [2019-11-15 21:27:44,930 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:44,930 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:44,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:44,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:44,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:44,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,006 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:45,007 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:45,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:45,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:45,013 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:45,013 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:45,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:45,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:45,021 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:45,021 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:45,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:45,025 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:45,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:45,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:45,040 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:45,041 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:45,041 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:45,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:45,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:45,042 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:45,042 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:45,042 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:45,042 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:45,042 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration17_Loop [2019-11-15 21:27:45,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:45,042 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:45,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,096 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:45,097 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:45,097 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-15 21:27:45,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:45,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:45,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:45,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:45,098 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:45,099 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:45,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:45,101 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-15 21:27:45,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:45,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:45,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:45,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:45,102 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:45,103 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:45,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:45,104 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-15 21:27:45,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:45,104 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:45,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:45,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:45,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:45,105 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:45,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:45,108 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:45,110 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:45,110 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:45,110 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:45,110 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:45,111 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:45,111 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 6 Supporting invariants [] [2019-11-15 21:27:45,111 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:45,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:45,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:45,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:27:45,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-15 21:27:45,197 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 21:27:45,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-11-15 21:27:45,329 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24. Second operand 6 states. Result 473 states and 516 transitions. Complement of second has 15 states. [2019-11-15 21:27:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 21:27:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 21:27:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2019-11-15 21:27:45,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 48 letters. [2019-11-15 21:27:45,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:45,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 91 letters. Loop has 48 letters. [2019-11-15 21:27:45,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:45,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 96 letters. [2019-11-15 21:27:45,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:45,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 473 states and 516 transitions. [2019-11-15 21:27:45,359 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-15 21:27:45,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 473 states to 431 states and 474 transitions. [2019-11-15 21:27:45,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2019-11-15 21:27:45,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2019-11-15 21:27:45,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 474 transitions. [2019-11-15 21:27:45,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:45,364 INFO L688 BuchiCegarLoop]: Abstraction has 431 states and 474 transitions. [2019-11-15 21:27:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 474 transitions. [2019-11-15 21:27:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 409. [2019-11-15 21:27:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-15 21:27:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 450 transitions. [2019-11-15 21:27:45,372 INFO L711 BuchiCegarLoop]: Abstraction has 409 states and 450 transitions. [2019-11-15 21:27:45,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:45,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 21:27:45,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:27:45,372 INFO L87 Difference]: Start difference. First operand 409 states and 450 transitions. Second operand 13 states. [2019-11-15 21:27:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:45,407 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2019-11-15 21:27:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:27:45,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 305 transitions. [2019-11-15 21:27:45,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:45,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 255 states and 286 transitions. [2019-11-15 21:27:45,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-11-15 21:27:45,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-11-15 21:27:45,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 286 transitions. [2019-11-15 21:27:45,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:45,413 INFO L688 BuchiCegarLoop]: Abstraction has 255 states and 286 transitions. [2019-11-15 21:27:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 286 transitions. [2019-11-15 21:27:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 167. [2019-11-15 21:27:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-15 21:27:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2019-11-15 21:27:45,417 INFO L711 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2019-11-15 21:27:45,417 INFO L591 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2019-11-15 21:27:45,417 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-15 21:27:45,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 188 transitions. [2019-11-15 21:27:45,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:45,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:45,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:45,420 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-15 21:27:45,420 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2019-11-15 21:27:45,420 INFO L791 eck$LassoCheckResult]: Stem: 6228#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; 6229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6243#L12 assume !(main_~i~0 >= 10); 6320#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6319#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6234#L12 assume !(main_~i~0 >= 10); 6226#L12-2 assume !(main_~i~0 <= 0); 6227#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6232#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6233#L12 assume !(main_~i~0 >= 10); 6317#L12-2 assume !(main_~i~0 <= 0); 6236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6237#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6316#L12 assume !(main_~i~0 >= 10); 6315#L12-2 assume !(main_~i~0 <= 0); 6314#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6312#L12 assume !(main_~i~0 >= 10); 6311#L12-2 assume !(main_~i~0 <= 0); 6310#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6308#L12 assume !(main_~i~0 >= 10); 6307#L12-2 assume !(main_~i~0 <= 0); 6306#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6304#L12 assume !(main_~i~0 >= 10); 6303#L12-2 assume !(main_~i~0 <= 0); 6302#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6300#L12 assume !(main_~i~0 >= 10); 6299#L12-2 assume !(main_~i~0 <= 0); 6298#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6296#L12 assume !(main_~i~0 >= 10); 6295#L12-2 assume !(main_~i~0 <= 0); 6294#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6293#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6249#L12 assume !(main_~i~0 >= 10); 6292#L12-2 assume !(main_~i~0 <= 0); 6291#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6248#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6247#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2019-11-15 21:27:45,420 INFO L793 eck$LassoCheckResult]: Loop: 6246#L12-2 assume !(main_~i~0 <= 0); 6244#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6241#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6242#L12 assume !(main_~i~0 >= 10); 6326#L12-2 assume !(main_~i~0 <= 0); 6324#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6330#L12 assume !(main_~i~0 >= 10); 6331#L12-2 assume !(main_~i~0 <= 0); 6327#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6322#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6323#L12 assume !(main_~i~0 >= 10); 6289#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6286#L12 assume !(main_~i~0 >= 10); 6285#L12-2 assume !(main_~i~0 <= 0); 6284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6282#L12 assume !(main_~i~0 >= 10); 6281#L12-2 assume !(main_~i~0 <= 0); 6280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6278#L12 assume !(main_~i~0 >= 10); 6277#L12-2 assume !(main_~i~0 <= 0); 6276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6275#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6274#L12 assume !(main_~i~0 >= 10); 6273#L12-2 assume !(main_~i~0 <= 0); 6272#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6270#L12 assume !(main_~i~0 >= 10); 6269#L12-2 assume !(main_~i~0 <= 0); 6268#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6266#L12 assume !(main_~i~0 >= 10); 6265#L12-2 assume !(main_~i~0 <= 0); 6264#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6262#L12 assume !(main_~i~0 >= 10); 6261#L12-2 assume !(main_~i~0 <= 0); 6260#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6259#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6258#L12 assume !(main_~i~0 >= 10); 6257#L12-2 assume !(main_~i~0 <= 0); 6256#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6254#L12 assume !(main_~i~0 >= 10); 6253#L12-2 assume !(main_~i~0 <= 0); 6252#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6251#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2019-11-15 21:27:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2019-11-15 21:27:45,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:45,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777073502] [2019-11-15 21:27:45,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:45,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:45,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:45,432 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:45,432 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2019-11-15 21:27:45,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:45,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073399580] [2019-11-15 21:27:45,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:45,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:45,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:45,444 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 4 times [2019-11-15 21:27:45,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:45,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506370123] [2019-11-15 21:27:45,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:45,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:45,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:45,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506370123] [2019-11-15 21:27:45,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627996815] [2019-11-15 21:27:45,490 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:45,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:27:45,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:45,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:27:45,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:45,569 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:45,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-15 21:27:45,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101368639] [2019-11-15 21:27:45,833 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 55 [2019-11-15 21:27:45,854 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:45,854 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:45,854 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:45,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:45,854 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:45,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:45,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:45,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:45,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration18_Loop [2019-11-15 21:27:45,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:45,855 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:45,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,920 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:45,921 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:45,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:45,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:45,931 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:45,931 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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) [2019-11-15 21:27:45,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:45,935 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:45,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:45,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:45,947 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:45,948 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:45,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:45,949 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:45,949 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:45,949 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:45,949 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:45,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:45,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:45,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration18_Loop [2019-11-15 21:27:45,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:45,949 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:45,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:45,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:46,016 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:46,016 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:46,016 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-15 21:27:46,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:46,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:46,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:46,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:46,018 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:46,018 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:46,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:46,020 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-15 21:27:46,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:46,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:46,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:46,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:46,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:46,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:46,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:46,023 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:46,025 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:46,025 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:46,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:46,025 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:46,026 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:46,026 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2019-11-15 21:27:46,026 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:46,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:46,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:46,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:46,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:27:46,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-15 21:27:46,118 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-15 21:27:46,118 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24 Second operand 7 states. [2019-11-15 21:27:46,332 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24. Second operand 7 states. Result 529 states and 572 transitions. Complement of second has 19 states. [2019-11-15 21:27:46,334 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-15 21:27:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 21:27:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2019-11-15 21:27:46,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2019-11-15 21:27:46,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:46,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2019-11-15 21:27:46,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:46,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2019-11-15 21:27:46,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:46,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 572 transitions. [2019-11-15 21:27:46,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-15 21:27:46,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 459 states and 502 transitions. [2019-11-15 21:27:46,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-11-15 21:27:46,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2019-11-15 21:27:46,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 502 transitions. [2019-11-15 21:27:46,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:46,346 INFO L688 BuchiCegarLoop]: Abstraction has 459 states and 502 transitions. [2019-11-15 21:27:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 502 transitions. [2019-11-15 21:27:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-11-15 21:27:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-15 21:27:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 456 transitions. [2019-11-15 21:27:46,355 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 456 transitions. [2019-11-15 21:27:46,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:46,356 INFO L87 Difference]: Start difference. First operand 417 states and 456 transitions. Second operand 6 states. [2019-11-15 21:27:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:46,392 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2019-11-15 21:27:46,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:27:46,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 319 transitions. [2019-11-15 21:27:46,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:46,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 263 states and 292 transitions. [2019-11-15 21:27:46,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2019-11-15 21:27:46,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2019-11-15 21:27:46,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 292 transitions. [2019-11-15 21:27:46,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:46,397 INFO L688 BuchiCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-11-15 21:27:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 292 transitions. [2019-11-15 21:27:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 171. [2019-11-15 21:27:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:27:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 191 transitions. [2019-11-15 21:27:46,401 INFO L711 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2019-11-15 21:27:46,401 INFO L591 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2019-11-15 21:27:46,401 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-15 21:27:46,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 191 transitions. [2019-11-15 21:27:46,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:46,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:46,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:46,404 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-15 21:27:46,404 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2019-11-15 21:27:46,404 INFO L791 eck$LassoCheckResult]: Stem: 8251#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; 8252#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8266#L12 assume !(main_~i~0 >= 10); 8344#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8343#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8342#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8257#L12 assume !(main_~i~0 >= 10); 8249#L12-2 assume !(main_~i~0 <= 0); 8250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8256#L12 assume !(main_~i~0 >= 10); 8341#L12-2 assume !(main_~i~0 <= 0); 8259#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8340#L12 assume !(main_~i~0 >= 10); 8339#L12-2 assume !(main_~i~0 <= 0); 8338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8337#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8336#L12 assume !(main_~i~0 >= 10); 8335#L12-2 assume !(main_~i~0 <= 0); 8334#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8332#L12 assume !(main_~i~0 >= 10); 8331#L12-2 assume !(main_~i~0 <= 0); 8330#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8328#L12 assume !(main_~i~0 >= 10); 8327#L12-2 assume !(main_~i~0 <= 0); 8326#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8324#L12 assume !(main_~i~0 >= 10); 8323#L12-2 assume !(main_~i~0 <= 0); 8322#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8321#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8320#L12 assume !(main_~i~0 >= 10); 8319#L12-2 assume !(main_~i~0 <= 0); 8318#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8275#L12 assume !(main_~i~0 >= 10); 8316#L12-2 assume !(main_~i~0 <= 0); 8315#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8271#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2019-11-15 21:27:46,404 INFO L793 eck$LassoCheckResult]: Loop: 8269#L12-2 assume !(main_~i~0 <= 0); 8267#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8381#L12 assume !(main_~i~0 >= 10); 8380#L12-2 assume !(main_~i~0 <= 0); 8379#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8377#L12 assume !(main_~i~0 >= 10); 8376#L12-2 assume !(main_~i~0 <= 0); 8375#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8351#L12 assume !(main_~i~0 >= 10); 8350#L12-2 assume !(main_~i~0 <= 0); 8348#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8352#L12 assume !(main_~i~0 >= 10); 8313#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8312#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8311#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8310#L12 assume !(main_~i~0 >= 10); 8309#L12-2 assume !(main_~i~0 <= 0); 8308#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8307#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8306#L12 assume !(main_~i~0 >= 10); 8305#L12-2 assume !(main_~i~0 <= 0); 8304#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8303#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8302#L12 assume !(main_~i~0 >= 10); 8301#L12-2 assume !(main_~i~0 <= 0); 8300#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8299#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8298#L12 assume !(main_~i~0 >= 10); 8297#L12-2 assume !(main_~i~0 <= 0); 8296#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8295#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8294#L12 assume !(main_~i~0 >= 10); 8293#L12-2 assume !(main_~i~0 <= 0); 8292#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8290#L12 assume !(main_~i~0 >= 10); 8289#L12-2 assume !(main_~i~0 <= 0); 8288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8286#L12 assume !(main_~i~0 >= 10); 8285#L12-2 assume !(main_~i~0 <= 0); 8284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8282#L12 assume !(main_~i~0 >= 10); 8281#L12-2 assume !(main_~i~0 <= 0); 8280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8278#L12 assume !(main_~i~0 >= 10); 8277#L12-2 assume !(main_~i~0 <= 0); 8276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8272#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8273#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2019-11-15 21:27:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2019-11-15 21:27:46,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:46,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889416378] [2019-11-15 21:27:46,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:46,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:46,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:46,422 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2019-11-15 21:27:46,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:46,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268300845] [2019-11-15 21:27:46,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:46,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:46,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:46,440 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:46,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:46,441 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 5 times [2019-11-15 21:27:46,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:46,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120600848] [2019-11-15 21:27:46,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:46,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:46,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:46,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120600848] [2019-11-15 21:27:46,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424434906] [2019-11-15 21:27:46,493 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:46,551 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-15 21:27:46,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:46,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:27:46,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:46,561 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:46,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-15 21:27:46,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358795795] [2019-11-15 21:27:46,822 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 58 [2019-11-15 21:27:46,836 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:46,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:46,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:46,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:46,836 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:46,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:46,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:46,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:46,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration19_Loop [2019-11-15 21:27:46,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:46,837 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:46,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:46,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:46,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:46,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:46,895 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:46,896 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:46,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:46,899 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:46,902 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:46,902 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:46,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:46,907 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:46,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:46,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:46,918 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:46,919 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:46,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:46,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:46,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:46,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:46,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:46,919 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:46,919 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:46,919 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration19_Loop [2019-11-15 21:27:46,919 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:46,919 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:46,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:46,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:46,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:46,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:46,969 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:46,969 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:46,969 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-15 21:27:46,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:46,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:46,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:46,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:46,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:46,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:46,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:46,972 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:46,973 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:46,973 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:46,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:46,973 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:46,974 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:46,974 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2019-11-15 21:27:46,974 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:46,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:46,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:46,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:47,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:27:47,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-15 21:27:47,057 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-15 21:27:47,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23 Second operand 8 states. [2019-11-15 21:27:47,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23. Second operand 8 states. Result 601 states and 644 transitions. Complement of second has 23 states. [2019-11-15 21:27:47,260 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-15 21:27:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 21:27:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2019-11-15 21:27:47,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2019-11-15 21:27:47,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:47,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2019-11-15 21:27:47,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:47,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2019-11-15 21:27:47,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:47,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 601 states and 644 transitions. [2019-11-15 21:27:47,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-15 21:27:47,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 601 states to 495 states and 538 transitions. [2019-11-15 21:27:47,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2019-11-15 21:27:47,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2019-11-15 21:27:47,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 538 transitions. [2019-11-15 21:27:47,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:47,271 INFO L688 BuchiCegarLoop]: Abstraction has 495 states and 538 transitions. [2019-11-15 21:27:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 538 transitions. [2019-11-15 21:27:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 425. [2019-11-15 21:27:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-15 21:27:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 462 transitions. [2019-11-15 21:27:47,279 INFO L711 BuchiCegarLoop]: Abstraction has 425 states and 462 transitions. [2019-11-15 21:27:47,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:47,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:27:47,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:27:47,280 INFO L87 Difference]: Start difference. First operand 425 states and 462 transitions. Second operand 7 states. [2019-11-15 21:27:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:47,334 INFO L93 Difference]: Finished difference Result 306 states and 333 transitions. [2019-11-15 21:27:47,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:27:47,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 333 transitions. [2019-11-15 21:27:47,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:47,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 271 states and 298 transitions. [2019-11-15 21:27:47,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2019-11-15 21:27:47,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2019-11-15 21:27:47,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 298 transitions. [2019-11-15 21:27:47,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:47,339 INFO L688 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2019-11-15 21:27:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 298 transitions. [2019-11-15 21:27:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 175. [2019-11-15 21:27:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-15 21:27:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 194 transitions. [2019-11-15 21:27:47,344 INFO L711 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2019-11-15 21:27:47,344 INFO L591 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2019-11-15 21:27:47,344 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-15 21:27:47,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 194 transitions. [2019-11-15 21:27:47,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:47,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:47,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:47,346 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-15 21:27:47,346 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2019-11-15 21:27:47,346 INFO L791 eck$LassoCheckResult]: Stem: 10407#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; 10408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10421#L12 assume !(main_~i~0 >= 10); 10501#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10500#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10498#L12 assume !(main_~i~0 >= 10); 10405#L12-2 assume !(main_~i~0 <= 0); 10406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10412#L12 assume !(main_~i~0 >= 10); 10415#L12-2 assume !(main_~i~0 <= 0); 10417#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10418#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10497#L12 assume !(main_~i~0 >= 10); 10496#L12-2 assume !(main_~i~0 <= 0); 10495#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10493#L12 assume !(main_~i~0 >= 10); 10492#L12-2 assume !(main_~i~0 <= 0); 10491#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10489#L12 assume !(main_~i~0 >= 10); 10488#L12-2 assume !(main_~i~0 <= 0); 10487#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10486#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10485#L12 assume !(main_~i~0 >= 10); 10484#L12-2 assume !(main_~i~0 <= 0); 10483#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10481#L12 assume !(main_~i~0 >= 10); 10480#L12-2 assume !(main_~i~0 <= 0); 10479#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10477#L12 assume !(main_~i~0 >= 10); 10476#L12-2 assume !(main_~i~0 <= 0); 10475#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10432#L12 assume !(main_~i~0 >= 10); 10473#L12-2 assume !(main_~i~0 <= 0); 10472#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10428#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2019-11-15 21:27:47,347 INFO L793 eck$LassoCheckResult]: Loop: 10427#L12-2 assume !(main_~i~0 <= 0); 10424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10425#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10538#L12 assume !(main_~i~0 >= 10); 10537#L12-2 assume !(main_~i~0 <= 0); 10536#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10535#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10534#L12 assume !(main_~i~0 >= 10); 10533#L12-2 assume !(main_~i~0 <= 0); 10532#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10531#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10530#L12 assume !(main_~i~0 >= 10); 10529#L12-2 assume !(main_~i~0 <= 0); 10528#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10527#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10508#L12 assume !(main_~i~0 >= 10); 10507#L12-2 assume !(main_~i~0 <= 0); 10505#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10506#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10509#L12 assume !(main_~i~0 >= 10); 10470#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10469#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10468#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10467#L12 assume !(main_~i~0 >= 10); 10466#L12-2 assume !(main_~i~0 <= 0); 10465#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10464#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10463#L12 assume !(main_~i~0 >= 10); 10462#L12-2 assume !(main_~i~0 <= 0); 10461#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10460#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10459#L12 assume !(main_~i~0 >= 10); 10458#L12-2 assume !(main_~i~0 <= 0); 10457#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10456#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10455#L12 assume !(main_~i~0 >= 10); 10454#L12-2 assume !(main_~i~0 <= 0); 10453#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10452#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10451#L12 assume !(main_~i~0 >= 10); 10450#L12-2 assume !(main_~i~0 <= 0); 10449#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10447#L12 assume !(main_~i~0 >= 10); 10446#L12-2 assume !(main_~i~0 <= 0); 10445#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10444#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10443#L12 assume !(main_~i~0 >= 10); 10442#L12-2 assume !(main_~i~0 <= 0); 10441#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10440#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10439#L12 assume !(main_~i~0 >= 10); 10438#L12-2 assume !(main_~i~0 <= 0); 10437#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10436#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10435#L12 assume !(main_~i~0 >= 10); 10434#L12-2 assume !(main_~i~0 <= 0); 10433#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10429#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10430#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2019-11-15 21:27:47,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:47,347 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2019-11-15 21:27:47,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:47,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679238076] [2019-11-15 21:27:47,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:47,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:47,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:47,357 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:47,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2019-11-15 21:27:47,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:47,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772736478] [2019-11-15 21:27:47,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:47,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:47,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:47,369 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 6 times [2019-11-15 21:27:47,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:47,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160987621] [2019-11-15 21:27:47,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:47,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:47,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:47,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160987621] [2019-11-15 21:27:47,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630061877] [2019-11-15 21:27:47,461 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:47,548 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-11-15 21:27:47,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:47,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:27:47,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:47,561 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:47,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-15 21:27:47,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650678067] [2019-11-15 21:27:47,860 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 60 [2019-11-15 21:27:47,881 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:47,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:47,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:47,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:47,881 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:47,881 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:47,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:47,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:47,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration20_Loop [2019-11-15 21:27:47,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:47,882 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:47,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:47,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:47,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:47,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:47,950 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:47,950 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:47,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:47,959 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:47,963 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:47,963 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_973e82af-6787-4a52-b33d-c34e873ddff2/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) [2019-11-15 21:27:47,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:47,969 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:47,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:47,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:47,993 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:47,994 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:47,995 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:47,995 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:47,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:47,995 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:47,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:47,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:47,995 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:47,995 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration20_Loop [2019-11-15 21:27:47,995 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:47,995 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:47,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:48,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:48,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:48,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:48,048 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:48,048 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:48,048 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-15 21:27:48,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:48,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:48,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:48,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:48,050 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:48,050 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:48,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:48,051 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-15 21:27:48,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:48,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:48,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:48,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:48,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:48,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:48,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:48,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:48,052 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-15 21:27:48,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:48,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:48,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:48,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:48,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:48,053 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:48,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:48,055 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:48,056 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:48,056 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:48,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:48,057 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:48,057 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:48,057 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [2019-11-15 21:27:48,058 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:48,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:48,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:48,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:27:48,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-15 21:27:48,185 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-15 21:27:48,185 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22 Second operand 9 states. [2019-11-15 21:27:48,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22. Second operand 9 states. Result 689 states and 732 transitions. Complement of second has 27 states. [2019-11-15 21:27:48,523 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-15 21:27:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 21:27:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2019-11-15 21:27:48,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2019-11-15 21:27:48,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:48,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2019-11-15 21:27:48,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:48,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2019-11-15 21:27:48,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:48,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 689 states and 732 transitions. [2019-11-15 21:27:48,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-15 21:27:48,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 689 states to 539 states and 582 transitions. [2019-11-15 21:27:48,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2019-11-15 21:27:48,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2019-11-15 21:27:48,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 539 states and 582 transitions. [2019-11-15 21:27:48,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:48,535 INFO L688 BuchiCegarLoop]: Abstraction has 539 states and 582 transitions. [2019-11-15 21:27:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states and 582 transitions. [2019-11-15 21:27:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 433. [2019-11-15 21:27:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-15 21:27:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 468 transitions. [2019-11-15 21:27:48,544 INFO L711 BuchiCegarLoop]: Abstraction has 433 states and 468 transitions. [2019-11-15 21:27:48,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:27:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:27:48,544 INFO L87 Difference]: Start difference. First operand 433 states and 468 transitions. Second operand 8 states. [2019-11-15 21:27:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:48,615 INFO L93 Difference]: Finished difference Result 322 states and 347 transitions. [2019-11-15 21:27:48,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:48,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 347 transitions. [2019-11-15 21:27:48,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:48,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 279 states and 304 transitions. [2019-11-15 21:27:48,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2019-11-15 21:27:48,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2019-11-15 21:27:48,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 304 transitions. [2019-11-15 21:27:48,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:48,620 INFO L688 BuchiCegarLoop]: Abstraction has 279 states and 304 transitions. [2019-11-15 21:27:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 304 transitions. [2019-11-15 21:27:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 179. [2019-11-15 21:27:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 21:27:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-11-15 21:27:48,623 INFO L711 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-11-15 21:27:48,624 INFO L591 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-11-15 21:27:48,624 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-15 21:27:48,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 197 transitions. [2019-11-15 21:27:48,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:48,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:48,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:48,629 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-15 21:27:48,629 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2019-11-15 21:27:48,630 INFO L791 eck$LassoCheckResult]: Stem: 12712#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; 12713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12728#L12 assume !(main_~i~0 >= 10); 12806#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12805#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12804#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12720#L12 assume !(main_~i~0 >= 10); 12721#L12-2 assume !(main_~i~0 <= 0); 12803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12717#L12 assume !(main_~i~0 >= 10); 12710#L12-2 assume !(main_~i~0 <= 0); 12711#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12723#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12802#L12 assume !(main_~i~0 >= 10); 12801#L12-2 assume !(main_~i~0 <= 0); 12800#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12799#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12798#L12 assume !(main_~i~0 >= 10); 12797#L12-2 assume !(main_~i~0 <= 0); 12796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12795#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12794#L12 assume !(main_~i~0 >= 10); 12793#L12-2 assume !(main_~i~0 <= 0); 12792#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12791#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12790#L12 assume !(main_~i~0 >= 10); 12789#L12-2 assume !(main_~i~0 <= 0); 12788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12787#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12786#L12 assume !(main_~i~0 >= 10); 12785#L12-2 assume !(main_~i~0 <= 0); 12784#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12783#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12782#L12 assume !(main_~i~0 >= 10); 12781#L12-2 assume !(main_~i~0 <= 0); 12780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12779#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12737#L12 assume !(main_~i~0 >= 10); 12778#L12-2 assume !(main_~i~0 <= 0); 12777#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12736#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12733#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2019-11-15 21:27:48,630 INFO L793 eck$LassoCheckResult]: Loop: 12731#L12-2 assume !(main_~i~0 <= 0); 12729#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12730#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12843#L12 assume !(main_~i~0 >= 10); 12842#L12-2 assume !(main_~i~0 <= 0); 12841#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12840#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12839#L12 assume !(main_~i~0 >= 10); 12838#L12-2 assume !(main_~i~0 <= 0); 12837#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12836#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12835#L12 assume !(main_~i~0 >= 10); 12834#L12-2 assume !(main_~i~0 <= 0); 12833#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12832#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12831#L12 assume !(main_~i~0 >= 10); 12830#L12-2 assume !(main_~i~0 <= 0); 12829#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12828#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12813#L12 assume !(main_~i~0 >= 10); 12814#L12-2 assume !(main_~i~0 <= 0); 12810#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12809#L12 assume !(main_~i~0 >= 10); 12775#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12772#L12 assume !(main_~i~0 >= 10); 12771#L12-2 assume !(main_~i~0 <= 0); 12770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12768#L12 assume !(main_~i~0 >= 10); 12767#L12-2 assume !(main_~i~0 <= 0); 12766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12764#L12 assume !(main_~i~0 >= 10); 12763#L12-2 assume !(main_~i~0 <= 0); 12762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12760#L12 assume !(main_~i~0 >= 10); 12759#L12-2 assume !(main_~i~0 <= 0); 12758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12756#L12 assume !(main_~i~0 >= 10); 12755#L12-2 assume !(main_~i~0 <= 0); 12754#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12752#L12 assume !(main_~i~0 >= 10); 12751#L12-2 assume !(main_~i~0 <= 0); 12750#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12748#L12 assume !(main_~i~0 >= 10); 12747#L12-2 assume !(main_~i~0 <= 0); 12746#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12745#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12744#L12 assume !(main_~i~0 >= 10); 12743#L12-2 assume !(main_~i~0 <= 0); 12742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12740#L12 assume !(main_~i~0 >= 10); 12739#L12-2 assume !(main_~i~0 <= 0); 12738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12734#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12735#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2019-11-15 21:27:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:48,630 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2019-11-15 21:27:48,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:48,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766449597] [2019-11-15 21:27:48,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:48,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:48,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:48,643 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2019-11-15 21:27:48,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:48,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924876577] [2019-11-15 21:27:48,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:48,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:48,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:48,662 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:48,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:48,662 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 7 times [2019-11-15 21:27:48,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:48,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941252133] [2019-11-15 21:27:48,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:48,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:48,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:48,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941252133] [2019-11-15 21:27:48,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995704427] [2019-11-15 21:27:48,748 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:48,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:27:48,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:48,847 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:48,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-15 21:27:48,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318085951] [2019-11-15 21:27:49,171 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 65 [2019-11-15 21:27:49,191 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:49,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:49,191 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:49,191 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:49,191 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:49,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:49,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:49,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:49,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration21_Loop [2019-11-15 21:27:49,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:49,192 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:49,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:49,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:49,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:49,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:49,247 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:49,247 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:49,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:49,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:49,253 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:49,253 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:49,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:49,257 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:49,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:49,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:49,270 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:49,271 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:49,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:49,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:49,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:49,272 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:49,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:49,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:49,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:49,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration21_Loop [2019-11-15 21:27:49,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:49,272 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:49,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:49,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:49,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:49,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:49,326 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:49,326 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:49,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-15 21:27:49,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:49,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:49,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:49,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:49,328 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:49,328 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:49,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:49,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:27:49,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:49,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:49,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:49,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:49,330 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:49,330 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:49,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:49,332 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-15 21:27:49,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:49,332 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:49,332 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:49,332 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:49,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:49,333 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:49,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:49,334 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:49,335 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:49,335 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:49,335 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:49,335 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:49,335 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:49,336 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2019-11-15 21:27:49,336 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:49,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:49,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:49,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:27:49,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-15 21:27:49,450 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-15 21:27:49,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21 Second operand 10 states. [2019-11-15 21:27:49,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21. Second operand 10 states. Result 793 states and 836 transitions. Complement of second has 31 states. [2019-11-15 21:27:49,792 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-15 21:27:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 21:27:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2019-11-15 21:27:49,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2019-11-15 21:27:49,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:49,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2019-11-15 21:27:49,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:49,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2019-11-15 21:27:49,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:49,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 793 states and 836 transitions. [2019-11-15 21:27:49,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-15 21:27:49,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 793 states to 591 states and 634 transitions. [2019-11-15 21:27:49,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2019-11-15 21:27:49,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 323 [2019-11-15 21:27:49,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 591 states and 634 transitions. [2019-11-15 21:27:49,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:49,806 INFO L688 BuchiCegarLoop]: Abstraction has 591 states and 634 transitions. [2019-11-15 21:27:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states and 634 transitions. [2019-11-15 21:27:49,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 441. [2019-11-15 21:27:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-15 21:27:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 474 transitions. [2019-11-15 21:27:49,816 INFO L711 BuchiCegarLoop]: Abstraction has 441 states and 474 transitions. [2019-11-15 21:27:49,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:27:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:27:49,817 INFO L87 Difference]: Start difference. First operand 441 states and 474 transitions. Second operand 9 states. [2019-11-15 21:27:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:49,895 INFO L93 Difference]: Finished difference Result 338 states and 361 transitions. [2019-11-15 21:27:49,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:27:49,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 361 transitions. [2019-11-15 21:27:49,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:49,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 287 states and 310 transitions. [2019-11-15 21:27:49,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2019-11-15 21:27:49,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2019-11-15 21:27:49,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 310 transitions. [2019-11-15 21:27:49,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:49,900 INFO L688 BuchiCegarLoop]: Abstraction has 287 states and 310 transitions. [2019-11-15 21:27:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 310 transitions. [2019-11-15 21:27:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 183. [2019-11-15 21:27:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-15 21:27:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2019-11-15 21:27:49,905 INFO L711 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2019-11-15 21:27:49,905 INFO L591 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2019-11-15 21:27:49,906 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-15 21:27:49,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 200 transitions. [2019-11-15 21:27:49,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:49,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:49,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:49,908 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-15 21:27:49,908 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2019-11-15 21:27:49,908 INFO L791 eck$LassoCheckResult]: Stem: 15182#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; 15183#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15198#L12 assume !(main_~i~0 >= 10); 15276#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15275#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15190#L12 assume !(main_~i~0 >= 10); 15180#L12-2 assume !(main_~i~0 <= 0); 15181#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15186#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15187#L12 assume !(main_~i~0 >= 10); 15273#L12-2 assume !(main_~i~0 <= 0); 15192#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15193#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15272#L12 assume !(main_~i~0 >= 10); 15271#L12-2 assume !(main_~i~0 <= 0); 15270#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15268#L12 assume !(main_~i~0 >= 10); 15267#L12-2 assume !(main_~i~0 <= 0); 15266#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15264#L12 assume !(main_~i~0 >= 10); 15263#L12-2 assume !(main_~i~0 <= 0); 15262#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15260#L12 assume !(main_~i~0 >= 10); 15259#L12-2 assume !(main_~i~0 <= 0); 15258#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15256#L12 assume !(main_~i~0 >= 10); 15255#L12-2 assume !(main_~i~0 <= 0); 15254#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15253#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15252#L12 assume !(main_~i~0 >= 10); 15251#L12-2 assume !(main_~i~0 <= 0); 15250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15249#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15205#L12 assume !(main_~i~0 >= 10); 15248#L12-2 assume !(main_~i~0 <= 0); 15247#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15204#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15203#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2019-11-15 21:27:49,909 INFO L793 eck$LassoCheckResult]: Loop: 15201#L12-2 assume !(main_~i~0 <= 0); 15199#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15200#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15313#L12 assume !(main_~i~0 >= 10); 15312#L12-2 assume !(main_~i~0 <= 0); 15311#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15309#L12 assume !(main_~i~0 >= 10); 15308#L12-2 assume !(main_~i~0 <= 0); 15307#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15306#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15305#L12 assume !(main_~i~0 >= 10); 15304#L12-2 assume !(main_~i~0 <= 0); 15303#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15302#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15301#L12 assume !(main_~i~0 >= 10); 15300#L12-2 assume !(main_~i~0 <= 0); 15299#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15298#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15297#L12 assume !(main_~i~0 >= 10); 15296#L12-2 assume !(main_~i~0 <= 0); 15295#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15294#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15283#L12 assume !(main_~i~0 >= 10); 15282#L12-2 assume !(main_~i~0 <= 0); 15280#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15281#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15284#L12 assume !(main_~i~0 >= 10); 15245#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15244#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15242#L12 assume !(main_~i~0 >= 10); 15241#L12-2 assume !(main_~i~0 <= 0); 15240#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15239#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15238#L12 assume !(main_~i~0 >= 10); 15237#L12-2 assume !(main_~i~0 <= 0); 15236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15235#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15234#L12 assume !(main_~i~0 >= 10); 15233#L12-2 assume !(main_~i~0 <= 0); 15232#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15231#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15230#L12 assume !(main_~i~0 >= 10); 15229#L12-2 assume !(main_~i~0 <= 0); 15228#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15227#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15226#L12 assume !(main_~i~0 >= 10); 15225#L12-2 assume !(main_~i~0 <= 0); 15224#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15223#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15222#L12 assume !(main_~i~0 >= 10); 15221#L12-2 assume !(main_~i~0 <= 0); 15220#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15219#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15218#L12 assume !(main_~i~0 >= 10); 15217#L12-2 assume !(main_~i~0 <= 0); 15216#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15215#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15214#L12 assume !(main_~i~0 >= 10); 15213#L12-2 assume !(main_~i~0 <= 0); 15212#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15211#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15210#L12 assume !(main_~i~0 >= 10); 15209#L12-2 assume !(main_~i~0 <= 0); 15208#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15207#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2019-11-15 21:27:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2019-11-15 21:27:49,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:49,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239033575] [2019-11-15 21:27:49,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:49,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:49,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:49,921 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:49,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:49,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2019-11-15 21:27:49,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:49,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625676744] [2019-11-15 21:27:49,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:49,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:49,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:49,943 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:49,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 8 times [2019-11-15 21:27:49,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:49,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178342184] [2019-11-15 21:27:49,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:49,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:49,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:50,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178342184] [2019-11-15 21:27:50,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797109714] [2019-11-15 21:27:50,100 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:50,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:27:50,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:50,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:27:50,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:50,198 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:50,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-15 21:27:50,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646655946] [2019-11-15 21:27:50,598 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 68 [2019-11-15 21:27:50,607 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:50,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:50,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:50,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:50,608 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:50,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:50,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:50,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:50,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration22_Loop [2019-11-15 21:27:50,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:50,608 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:50,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:50,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:50,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:50,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:50,666 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:50,667 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:50,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:50,682 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:50,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:50,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:50,692 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:50,693 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:50,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:50,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:50,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:50,694 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:50,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:50,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:50,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:50,694 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration22_Loop [2019-11-15 21:27:50,694 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:50,694 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:50,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:50,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:50,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:50,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:50,746 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:50,747 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:50,747 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-15 21:27:50,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:50,747 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:50,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:50,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:50,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:50,748 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:50,748 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:50,749 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:50,750 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:50,750 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:50,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:50,751 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:50,751 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:50,751 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2019-11-15 21:27:50,751 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:50,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:50,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:50,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 21:27:50,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-15 21:27:50,900 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-15 21:27:50,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20 Second operand 11 states. [2019-11-15 21:27:51,413 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20. Second operand 11 states. Result 913 states and 956 transitions. Complement of second has 35 states. [2019-11-15 21:27:51,413 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-15 21:27:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 21:27:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2019-11-15 21:27:51,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2019-11-15 21:27:51,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:51,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2019-11-15 21:27:51,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:51,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2019-11-15 21:27:51,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:51,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 956 transitions. [2019-11-15 21:27:51,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-15 21:27:51,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 651 states and 694 transitions. [2019-11-15 21:27:51,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2019-11-15 21:27:51,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2019-11-15 21:27:51,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 651 states and 694 transitions. [2019-11-15 21:27:51,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:51,427 INFO L688 BuchiCegarLoop]: Abstraction has 651 states and 694 transitions. [2019-11-15 21:27:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states and 694 transitions. [2019-11-15 21:27:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 449. [2019-11-15 21:27:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 21:27:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 480 transitions. [2019-11-15 21:27:51,435 INFO L711 BuchiCegarLoop]: Abstraction has 449 states and 480 transitions. [2019-11-15 21:27:51,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:27:51,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:27:51,436 INFO L87 Difference]: Start difference. First operand 449 states and 480 transitions. Second operand 10 states. [2019-11-15 21:27:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:51,515 INFO L93 Difference]: Finished difference Result 354 states and 375 transitions. [2019-11-15 21:27:51,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:27:51,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 375 transitions. [2019-11-15 21:27:51,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:51,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 295 states and 316 transitions. [2019-11-15 21:27:51,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2019-11-15 21:27:51,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2019-11-15 21:27:51,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 316 transitions. [2019-11-15 21:27:51,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:51,522 INFO L688 BuchiCegarLoop]: Abstraction has 295 states and 316 transitions. [2019-11-15 21:27:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 316 transitions. [2019-11-15 21:27:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 187. [2019-11-15 21:27:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-15 21:27:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 203 transitions. [2019-11-15 21:27:51,527 INFO L711 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2019-11-15 21:27:51,527 INFO L591 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2019-11-15 21:27:51,527 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-15 21:27:51,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 203 transitions. [2019-11-15 21:27:51,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:51,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:51,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:51,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-15 21:27:51,529 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2019-11-15 21:27:51,529 INFO L791 eck$LassoCheckResult]: Stem: 17833#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; 17834#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17847#L12 assume !(main_~i~0 >= 10); 17931#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17930#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17929#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17928#L12 assume !(main_~i~0 >= 10); 17831#L12-2 assume !(main_~i~0 <= 0); 17832#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17838#L12 assume !(main_~i~0 >= 10); 17840#L12-2 assume !(main_~i~0 <= 0); 17925#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17922#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17921#L12 assume !(main_~i~0 >= 10); 17920#L12-2 assume !(main_~i~0 <= 0); 17919#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17918#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17917#L12 assume !(main_~i~0 >= 10); 17916#L12-2 assume !(main_~i~0 <= 0); 17915#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17914#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17913#L12 assume !(main_~i~0 >= 10); 17912#L12-2 assume !(main_~i~0 <= 0); 17911#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17910#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17909#L12 assume !(main_~i~0 >= 10); 17908#L12-2 assume !(main_~i~0 <= 0); 17907#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17906#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17905#L12 assume !(main_~i~0 >= 10); 17904#L12-2 assume !(main_~i~0 <= 0); 17903#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17901#L12 assume !(main_~i~0 >= 10); 17900#L12-2 assume !(main_~i~0 <= 0); 17899#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17898#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17856#L12 assume !(main_~i~0 >= 10); 17897#L12-2 assume !(main_~i~0 <= 0); 17896#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17855#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17852#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2019-11-15 21:27:51,530 INFO L793 eck$LassoCheckResult]: Loop: 17850#L12-2 assume !(main_~i~0 <= 0); 17848#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17964#L12 assume !(main_~i~0 >= 10); 17963#L12-2 assume !(main_~i~0 <= 0); 17962#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17960#L12 assume !(main_~i~0 >= 10); 17959#L12-2 assume !(main_~i~0 <= 0); 17958#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17957#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17956#L12 assume !(main_~i~0 >= 10); 17955#L12-2 assume !(main_~i~0 <= 0); 17954#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17953#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17952#L12 assume !(main_~i~0 >= 10); 17951#L12-2 assume !(main_~i~0 <= 0); 17950#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17949#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17948#L12 assume !(main_~i~0 >= 10); 17947#L12-2 assume !(main_~i~0 <= 0); 17946#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17945#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17944#L12 assume !(main_~i~0 >= 10); 17943#L12-2 assume !(main_~i~0 <= 0); 17942#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17941#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17935#L12 assume !(main_~i~0 >= 10); 17936#L12-2 assume !(main_~i~0 <= 0); 17926#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17927#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17937#L12 assume !(main_~i~0 >= 10); 17894#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17893#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17892#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17891#L12 assume !(main_~i~0 >= 10); 17890#L12-2 assume !(main_~i~0 <= 0); 17889#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17888#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17887#L12 assume !(main_~i~0 >= 10); 17886#L12-2 assume !(main_~i~0 <= 0); 17885#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17883#L12 assume !(main_~i~0 >= 10); 17882#L12-2 assume !(main_~i~0 <= 0); 17881#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17879#L12 assume !(main_~i~0 >= 10); 17878#L12-2 assume !(main_~i~0 <= 0); 17877#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17876#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17875#L12 assume !(main_~i~0 >= 10); 17874#L12-2 assume !(main_~i~0 <= 0); 17873#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17872#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17871#L12 assume !(main_~i~0 >= 10); 17870#L12-2 assume !(main_~i~0 <= 0); 17869#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17867#L12 assume !(main_~i~0 >= 10); 17866#L12-2 assume !(main_~i~0 <= 0); 17865#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17864#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17863#L12 assume !(main_~i~0 >= 10); 17862#L12-2 assume !(main_~i~0 <= 0); 17861#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17859#L12 assume !(main_~i~0 >= 10); 17858#L12-2 assume !(main_~i~0 <= 0); 17857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17854#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2019-11-15 21:27:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2019-11-15 21:27:51,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:51,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191579208] [2019-11-15 21:27:51,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:51,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:51,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:51,541 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:51,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2019-11-15 21:27:51,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:51,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891644085] [2019-11-15 21:27:51,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:51,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:51,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:51,557 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:51,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:51,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 9 times [2019-11-15 21:27:51,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:51,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337788841] [2019-11-15 21:27:51,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:51,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:51,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:51,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337788841] [2019-11-15 21:27:51,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206784027] [2019-11-15 21:27:51,660 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:51,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-11-15 21:27:51,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:51,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 21:27:51,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1112 proven. 226 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2019-11-15 21:27:51,766 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:51,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2019-11-15 21:27:51,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806473680] [2019-11-15 21:27:52,131 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 69 [2019-11-15 21:27:52,141 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:52,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:52,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:52,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:52,141 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:52,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:52,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:52,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:52,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration23_Loop [2019-11-15 21:27:52,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:52,142 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:52,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:52,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:52,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:52,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-15 21:27:52,188 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:52,188 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:52,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:52,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:52,194 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:52,194 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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:52,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:52,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:52,201 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:52,201 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_25=1} Honda state: {v_rep~unnamed0~0~true_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:52,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:52,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:52,215 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:52,216 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_25=0} Honda state: {v_rep~unnamed0~0~false_25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:52,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:52,220 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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-15 21:27:52,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:52,227 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:27:52,230 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:52,231 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:52,232 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:52,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:52,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:52,232 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:52,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:52,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:52,232 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:52,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration23_Loop [2019-11-15 21:27:52,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:52,232 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:52,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:52,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:52,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:52,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:52,295 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:52,295 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:52,295 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-15 21:27:52,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:52,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:52,296 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:52,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:52,297 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:52,297 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:52,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:52,298 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-15 21:27:52,298 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:52,299 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:52,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:52,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:52,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:52,299 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:52,299 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:52,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:52,300 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-15 21:27:52,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:52,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:52,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:52,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:52,301 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:52,301 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:52,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:52,304 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-15 21:27:52,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:52,305 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:52,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:52,305 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:52,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:52,306 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:52,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:52,307 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:52,308 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:52,308 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:52,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:52,309 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:52,309 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:52,310 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2019-11-15 21:27:52,310 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:52,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:52,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:52,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:52,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:27:52,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-15 21:27:52,465 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-15 21:27:52,465 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19 Second operand 12 states. [2019-11-15 21:27:52,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19. Second operand 12 states. Result 1050 states and 1093 transitions. Complement of second has 39 states. [2019-11-15 21:27:52,954 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-15 21:27:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 21:27:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2019-11-15 21:27:52,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2019-11-15 21:27:52,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:52,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2019-11-15 21:27:52,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:52,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2019-11-15 21:27:52,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:52,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1050 states and 1093 transitions. [2019-11-15 21:27:52,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-15 21:27:52,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1050 states to 720 states and 763 transitions. [2019-11-15 21:27:52,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 423 [2019-11-15 21:27:52,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2019-11-15 21:27:52,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 720 states and 763 transitions. [2019-11-15 21:27:52,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:52,974 INFO L688 BuchiCegarLoop]: Abstraction has 720 states and 763 transitions. [2019-11-15 21:27:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 763 transitions. [2019-11-15 21:27:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 457. [2019-11-15 21:27:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-15 21:27:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 486 transitions. [2019-11-15 21:27:52,982 INFO L711 BuchiCegarLoop]: Abstraction has 457 states and 486 transitions. [2019-11-15 21:27:52,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:52,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 21:27:52,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:27:52,983 INFO L87 Difference]: Start difference. First operand 457 states and 486 transitions. Second operand 13 states. [2019-11-15 21:27:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:53,089 INFO L93 Difference]: Finished difference Result 370 states and 389 transitions. [2019-11-15 21:27:53,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:27:53,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 389 transitions. [2019-11-15 21:27:53,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:53,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 303 states and 322 transitions. [2019-11-15 21:27:53,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2019-11-15 21:27:53,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2019-11-15 21:27:53,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 322 transitions. [2019-11-15 21:27:53,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:53,094 INFO L688 BuchiCegarLoop]: Abstraction has 303 states and 322 transitions. [2019-11-15 21:27:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 322 transitions. [2019-11-15 21:27:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 191. [2019-11-15 21:27:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-15 21:27:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2019-11-15 21:27:53,099 INFO L711 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2019-11-15 21:27:53,099 INFO L591 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2019-11-15 21:27:53,099 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-11-15 21:27:53,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 206 transitions. [2019-11-15 21:27:53,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:53,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:53,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:53,101 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-15 21:27:53,101 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2019-11-15 21:27:53,101 INFO L791 eck$LassoCheckResult]: Stem: 20684#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; 20685#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20695#L12 assume !(main_~i~0 >= 10); 20812#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20806#L12 assume !(main_~i~0 >= 10); 20804#L12-2 assume !(main_~i~0 <= 0); 20803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20688#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20689#L12 assume !(main_~i~0 >= 10); 20682#L12-2 assume !(main_~i~0 <= 0); 20683#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20691#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20800#L12 assume !(main_~i~0 >= 10); 20798#L12-2 assume !(main_~i~0 <= 0); 20796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20792#L12 assume !(main_~i~0 >= 10); 20790#L12-2 assume !(main_~i~0 <= 0); 20788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20784#L12 assume !(main_~i~0 >= 10); 20782#L12-2 assume !(main_~i~0 <= 0); 20780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20776#L12 assume !(main_~i~0 >= 10); 20774#L12-2 assume !(main_~i~0 <= 0); 20772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20768#L12 assume !(main_~i~0 >= 10); 20766#L12-2 assume !(main_~i~0 <= 0); 20764#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20760#L12 assume !(main_~i~0 >= 10); 20758#L12-2 assume !(main_~i~0 <= 0); 20756#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20705#L12 assume !(main_~i~0 >= 10); 20748#L12-2 assume !(main_~i~0 <= 0); 20745#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20704#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20701#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2019-11-15 21:27:53,101 INFO L793 eck$LassoCheckResult]: Loop: 20698#L12-2 assume !(main_~i~0 <= 0); 20699#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20811#L12 assume !(main_~i~0 >= 10); 20809#L12-2 assume !(main_~i~0 <= 0); 20807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20802#L12 assume !(main_~i~0 >= 10); 20801#L12-2 assume !(main_~i~0 <= 0); 20799#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20795#L12 assume !(main_~i~0 >= 10); 20793#L12-2 assume !(main_~i~0 <= 0); 20791#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20787#L12 assume !(main_~i~0 >= 10); 20785#L12-2 assume !(main_~i~0 <= 0); 20783#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20779#L12 assume !(main_~i~0 >= 10); 20777#L12-2 assume !(main_~i~0 <= 0); 20775#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20771#L12 assume !(main_~i~0 >= 10); 20769#L12-2 assume !(main_~i~0 <= 0); 20767#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20763#L12 assume !(main_~i~0 >= 10); 20761#L12-2 assume !(main_~i~0 <= 0); 20759#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20754#L12 assume !(main_~i~0 >= 10); 20751#L12-2 assume !(main_~i~0 <= 0); 20752#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20747#L12 assume !(main_~i~0 >= 10); 20743#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20740#L12 assume !(main_~i~0 >= 10); 20739#L12-2 assume !(main_~i~0 <= 0); 20738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20737#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20736#L12 assume !(main_~i~0 >= 10); 20735#L12-2 assume !(main_~i~0 <= 0); 20734#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20733#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20732#L12 assume !(main_~i~0 >= 10); 20731#L12-2 assume !(main_~i~0 <= 0); 20730#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20729#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20728#L12 assume !(main_~i~0 >= 10); 20727#L12-2 assume !(main_~i~0 <= 0); 20726#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20725#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20724#L12 assume !(main_~i~0 >= 10); 20723#L12-2 assume !(main_~i~0 <= 0); 20722#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20720#L12 assume !(main_~i~0 >= 10); 20719#L12-2 assume !(main_~i~0 <= 0); 20718#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20717#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20716#L12 assume !(main_~i~0 >= 10); 20715#L12-2 assume !(main_~i~0 <= 0); 20714#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20712#L12 assume !(main_~i~0 >= 10); 20711#L12-2 assume !(main_~i~0 <= 0); 20710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20708#L12 assume !(main_~i~0 >= 10); 20707#L12-2 assume !(main_~i~0 <= 0); 20706#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20702#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2019-11-15 21:27:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2019-11-15 21:27:53,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:53,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116459979] [2019-11-15 21:27:53,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:53,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:53,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:53,113 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2019-11-15 21:27:53,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:53,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868972936] [2019-11-15 21:27:53,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:53,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:53,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:53,127 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 10 times [2019-11-15 21:27:53,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:53,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552759504] [2019-11-15 21:27:53,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:53,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:53,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:53,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552759504] [2019-11-15 21:27:53,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639135273] [2019-11-15 21:27:53,243 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:27:53,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:27:53,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:27:53,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 21:27:53,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 21:27:53,349 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:27:53,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-11-15 21:27:53,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663962836] [2019-11-15 21:27:53,865 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 74 [2019-11-15 21:27:53,886 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:53,886 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:53,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:53,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:53,887 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:27:53,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:53,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:53,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:53,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration24_Loop [2019-11-15 21:27:53,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:53,887 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:53,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:53,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:53,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:53,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:53,953 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:53,953 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/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) [2019-11-15 21:27:53,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:53,960 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:53,964 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:53,964 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_27=1} Honda state: {v_rep~unnamed0~0~true_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:53,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:53,971 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:53,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:27:53,974 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_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:53,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:27:53,986 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:27:54,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:27:54,001 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:54,006 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:27:54,008 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:27:54,008 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:27:54,008 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:27:54,008 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:27:54,008 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:27:54,008 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:27:54,008 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:27:54,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:27:54,008 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration24_Loop [2019-11-15 21:27:54,009 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:27:54,009 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:27:54,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:54,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:54,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:54,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:27:54,072 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:27:54,072 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:27:54,073 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-15 21:27:54,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:54,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:54,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:54,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:54,074 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:27:54,074 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:27:54,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:54,075 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-15 21:27:54,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:54,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:54,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:54,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:54,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:54,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:54,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:54,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:27:54,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:27:54,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:27:54,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:27:54,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:27:54,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:27:54,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:27:54,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:27:54,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:27:54,084 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:27:54,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:27:54,085 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:27:54,086 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:27:54,086 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:27:54,086 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:27:54,086 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2019-11-15 21:27:54,087 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:27:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:54,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:27:54,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:54,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 21:27:54,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:27:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-15 21:27:54,280 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-15 21:27:54,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18 Second operand 13 states. [2019-11-15 21:27:54,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18. Second operand 13 states. Result 1203 states and 1246 transitions. Complement of second has 43 states. [2019-11-15 21:27:54,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2019-11-15 21:27:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:27:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2019-11-15 21:27:54,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 76 letters. [2019-11-15 21:27:54,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:54,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 119 letters. Loop has 76 letters. [2019-11-15 21:27:54,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:54,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 152 letters. [2019-11-15 21:27:54,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:27:54,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 1246 transitions. [2019-11-15 21:27:55,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:55,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 796 states and 837 transitions. [2019-11-15 21:27:55,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2019-11-15 21:27:55,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2019-11-15 21:27:55,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 796 states and 837 transitions. [2019-11-15 21:27:55,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:55,006 INFO L688 BuchiCegarLoop]: Abstraction has 796 states and 837 transitions. [2019-11-15 21:27:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states and 837 transitions. [2019-11-15 21:27:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 464. [2019-11-15 21:27:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-15 21:27:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 489 transitions. [2019-11-15 21:27:55,015 INFO L711 BuchiCegarLoop]: Abstraction has 464 states and 489 transitions. [2019-11-15 21:27:55,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:27:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:27:55,016 INFO L87 Difference]: Start difference. First operand 464 states and 489 transitions. Second operand 12 states. [2019-11-15 21:27:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:55,141 INFO L93 Difference]: Finished difference Result 388 states and 402 transitions. [2019-11-15 21:27:55,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:27:55,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 388 states and 402 transitions. [2019-11-15 21:27:55,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:55,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 388 states to 311 states and 325 transitions. [2019-11-15 21:27:55,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-11-15 21:27:55,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2019-11-15 21:27:55,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 325 transitions. [2019-11-15 21:27:55,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:27:55,148 INFO L688 BuchiCegarLoop]: Abstraction has 311 states and 325 transitions. [2019-11-15 21:27:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 325 transitions. [2019-11-15 21:27:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 115. [2019-11-15 21:27:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 21:27:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-11-15 21:27:55,151 INFO L711 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-15 21:27:55,151 INFO L591 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-15 21:27:55,151 INFO L424 BuchiCegarLoop]: ======== Iteration 25============ [2019-11-15 21:27:55,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 126 transitions. [2019-11-15 21:27:55,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-15 21:27:55,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:27:55,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:27:55,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:27:55,153 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2019-11-15 21:27:55,153 INFO L791 eck$LassoCheckResult]: Stem: 23748#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; 23749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2019-11-15 21:27:55,153 INFO L793 eck$LassoCheckResult]: Loop: 23796#L12 assume !(main_~i~0 >= 10); 23795#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 23794#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23793#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23792#L12 assume !(main_~i~0 >= 10); 23791#L12-2 assume !(main_~i~0 <= 0); 23790#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23788#L12 assume !(main_~i~0 >= 10); 23787#L12-2 assume !(main_~i~0 <= 0); 23786#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23785#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23784#L12 assume !(main_~i~0 >= 10); 23783#L12-2 assume !(main_~i~0 <= 0); 23782#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23780#L12 assume !(main_~i~0 >= 10); 23779#L12-2 assume !(main_~i~0 <= 0); 23778#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23777#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23776#L12 assume !(main_~i~0 >= 10); 23775#L12-2 assume !(main_~i~0 <= 0); 23774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23772#L12 assume !(main_~i~0 >= 10); 23771#L12-2 assume !(main_~i~0 <= 0); 23770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23768#L12 assume !(main_~i~0 >= 10); 23767#L12-2 assume !(main_~i~0 <= 0); 23766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23764#L12 assume !(main_~i~0 >= 10); 23763#L12-2 assume !(main_~i~0 <= 0); 23762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23760#L12 assume !(main_~i~0 >= 10); 23759#L12-2 assume !(main_~i~0 <= 0); 23758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23756#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 23755#L12-2 assume !(main_~i~0 <= 0); 23747#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23753#L12 assume !(main_~i~0 >= 10); 23744#L12-2 assume !(main_~i~0 <= 0); 23745#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23751#L12 assume !(main_~i~0 >= 10); 23754#L12-2 assume !(main_~i~0 <= 0); 23858#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23857#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23856#L12 assume !(main_~i~0 >= 10); 23855#L12-2 assume !(main_~i~0 <= 0); 23854#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23852#L12 assume !(main_~i~0 >= 10); 23851#L12-2 assume !(main_~i~0 <= 0); 23850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23848#L12 assume !(main_~i~0 >= 10); 23847#L12-2 assume !(main_~i~0 <= 0); 23846#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23844#L12 assume !(main_~i~0 >= 10); 23843#L12-2 assume !(main_~i~0 <= 0); 23842#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23840#L12 assume !(main_~i~0 >= 10); 23839#L12-2 assume !(main_~i~0 <= 0); 23838#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23836#L12 assume !(main_~i~0 >= 10); 23835#L12-2 assume !(main_~i~0 <= 0); 23809#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23806#L12 assume !(main_~i~0 >= 10); 23808#L12-2 assume !(main_~i~0 <= 0); 23807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2019-11-15 21:27:55,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:55,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-11-15 21:27:55,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:55,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425413455] [2019-11-15 21:27:55,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:55,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:55,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:55,158 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:55,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash -950527111, now seen corresponding path program 17 times [2019-11-15 21:27:55,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:55,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652129159] [2019-11-15 21:27:55,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:55,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:55,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:55,173 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:55,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2117507742, now seen corresponding path program 11 times [2019-11-15 21:27:55,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:55,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747725868] [2019-11-15 21:27:55,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:55,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:55,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:55,189 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:55,696 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 74 [2019-11-15 21:27:55,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:27:55 BoogieIcfgContainer [2019-11-15 21:27:55,735 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:27:55,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:27:55,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:27:55,736 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:27:55,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:27:37" (3/4) ... [2019-11-15 21:27:55,739 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 21:27:55,793 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_973e82af-6787-4a52-b33d-c34e873ddff2/bin/uautomizer/witness.graphml [2019-11-15 21:27:55,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:27:55,794 INFO L168 Benchmark]: Toolchain (without parser) took 18502.36 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 508.6 MB). Free memory was 948.7 MB in the beginning and 795.5 MB in the end (delta: 153.2 MB). Peak memory consumption was 661.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:27:55,795 INFO L168 Benchmark]: CDTParser took 0.26 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-15 21:27:55,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:27:55,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:27:55,795 INFO L168 Benchmark]: Boogie Preprocessor took 18.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:27:55,796 INFO L168 Benchmark]: RCFGBuilder took 203.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:27:55,796 INFO L168 Benchmark]: BuchiAutomizer took 17938.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 362.8 MB). Free memory was 1.1 GB in the beginning and 800.1 MB in the end (delta: 321.0 MB). Peak memory consumption was 683.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:27:55,796 INFO L168 Benchmark]: Witness Printer took 57.29 ms. Allocated memory is still 1.5 GB. Free memory was 800.1 MB in the beginning and 795.5 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:27:55,798 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.26 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 246.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 203.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17938.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 362.8 MB). Free memory was 1.1 GB in the beginning and 800.1 MB in the end (delta: 321.0 MB). Peak memory consumption was 683.8 MB. Max. memory is 11.5 GB. * Witness Printer took 57.29 ms. Allocated memory is still 1.5 GB. Free memory was 800.1 MB in the beginning and 795.5 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 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 36 terminating modules (22 trivial, 12 deterministic, 2 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 + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 6 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 13 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + 7 and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 15 and consists of 14 locations. One deterministic module has affine ranking function -1 * i + 8 and consists of 16 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 18 locations. One deterministic module has affine ranking function -1 * i + 9 and consists of 20 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 22 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 115 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.8s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 11.1s. Construction of modules took 2.0s. Büchi inclusion checks took 4.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 35. Automata minimization 0.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 2226 StatesRemovedByMinimization, 35 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 191 states and ocurred in iteration 23. Nontrivial modules had stage [12, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1368/3680 HoareTripleCheckerStatistics: 281 SDtfs, 858 SDslu, 9 SDs, 0 SdLazy, 2372 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT10 SILN0 SILU0 SILI9 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax161 hnf97 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq129 hnf96 smp94 dnf100 smp100 tf113 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 14 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: 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=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31354d9d=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: 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 0 <= i && i <= 10 Loop: [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...