./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Ex08_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Ex08_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0f19c27ba74e1ebec32cb641e6640521812ace19 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:46:06,946 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:46:06,948 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:46:06,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:46:06,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:46:06,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:46:06,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:46:06,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:46:06,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:46:06,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:46:06,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:46:06,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:46:06,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:46:06,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:46:06,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:46:06,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:46:06,970 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:46:06,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:46:06,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:46:06,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:46:06,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:46:06,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:46:06,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:46:06,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:46:06,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:46:06,980 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:46:06,981 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:46:06,982 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:46:06,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:46:06,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:46:06,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:46:06,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:46:06,985 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:46:06,985 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:46:06,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:46:06,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:46:06,987 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 03:46:07,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:46:07,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:46:07,001 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:46:07,001 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:46:07,002 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:46:07,002 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:46:07,002 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:46:07,002 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:46:07,002 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:46:07,003 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:46:07,003 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:46:07,003 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:46:07,003 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:46:07,003 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:46:07,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:46:07,003 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:46:07,004 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:46:07,004 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:46:07,004 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:46:07,004 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:46:07,004 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:46:07,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:46:07,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:46:07,005 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:46:07,005 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:46:07,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:46:07,005 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:46:07,005 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:46:07,006 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:46:07,006 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f19c27ba74e1ebec32cb641e6640521812ace19 [2018-11-23 03:46:07,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:46:07,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:46:07,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:46:07,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:46:07,053 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:46:07,054 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/Ex08_false-termination_true-no-overflow.c [2018-11-23 03:46:07,109 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/data/2123d42c9/0b6c4a7d657a4215891c827b95477fa2/FLAG02859ee7f [2018-11-23 03:46:07,444 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:46:07,445 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/sv-benchmarks/c/termination-restricted-15/Ex08_false-termination_true-no-overflow.c [2018-11-23 03:46:07,449 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/data/2123d42c9/0b6c4a7d657a4215891c827b95477fa2/FLAG02859ee7f [2018-11-23 03:46:07,459 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/data/2123d42c9/0b6c4a7d657a4215891c827b95477fa2 [2018-11-23 03:46:07,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:46:07,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:46:07,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:46:07,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:46:07,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:46:07,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f711c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07, skipping insertion in model container [2018-11-23 03:46:07,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:46:07,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:46:07,622 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:46:07,625 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:46:07,637 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:46:07,645 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:46:07,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07 WrapperNode [2018-11-23 03:46:07,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:46:07,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:46:07,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:46:07,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:46:07,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:46:07,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:46:07,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:46:07,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:46:07,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... [2018-11-23 03:46:07,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:46:07,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:46:07,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:46:07,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:46:07,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:46:07,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:46:07,865 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:46:07,866 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 03:46:07,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:46:07 BoogieIcfgContainer [2018-11-23 03:46:07,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:46:07,866 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:46:07,866 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:46:07,869 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:46:07,870 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:46:07,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:46:07" (1/3) ... [2018-11-23 03:46:07,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@301f843b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:46:07, skipping insertion in model container [2018-11-23 03:46:07,871 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:46:07,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:07" (2/3) ... [2018-11-23 03:46:07,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@301f843b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:46:07, skipping insertion in model container [2018-11-23 03:46:07,871 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:46:07,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:46:07" (3/3) ... [2018-11-23 03:46:07,873 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ex08_false-termination_true-no-overflow.c [2018-11-23 03:46:07,913 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:46:07,913 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:46:07,913 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:46:07,913 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:46:07,913 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:46:07,914 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:46:07,914 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:46:07,914 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:46:07,914 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:46:07,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-23 03:46:07,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 03:46:07,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:07,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:07,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 03:46:07,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:46:07,947 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:46:07,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-23 03:46:07,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 03:46:07,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:07,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:07,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 03:46:07,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:46:07,953 INFO L794 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 [2018-11-23 03:46:07,954 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(main_~i~0 > 0); 6#L12true assume 1 == main_~i~0;main_~up~0 := 1; 3#L12-2true assume 10 == main_~i~0;main_~up~0 := 0; 9#L15-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2018-11-23 03:46:07,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:07,958 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 03:46:07,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:07,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:08,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2018-11-23 03:46:08,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:08,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:08,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:46:08,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:46:08,091 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:08,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:46:08,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:46:08,105 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-11-23 03:46:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:08,147 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2018-11-23 03:46:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:46:08,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2018-11-23 03:46:08,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:46:08,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 14 transitions. [2018-11-23 03:46:08,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 03:46:08,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 03:46:08,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2018-11-23 03:46:08,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:46:08,156 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-11-23 03:46:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2018-11-23 03:46:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-23 03:46:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 03:46:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-11-23 03:46:08,184 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-11-23 03:46:08,184 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-11-23 03:46:08,184 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:46:08,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2018-11-23 03:46:08,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:46:08,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:08,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:08,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 03:46:08,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:46:08,186 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 34#L18-1 [2018-11-23 03:46:08,186 INFO L796 eck$LassoCheckResult]: Loop: 34#L18-1 assume !!(main_~i~0 > 0); 39#L12 assume !(1 == main_~i~0); 37#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 38#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 34#L18-1 [2018-11-23 03:46:08,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,186 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-23 03:46:08,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:08,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:08,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2018-11-23 03:46:08,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:08,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:08,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:08,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:46:08,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:46:08,236 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:08,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:46:08,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:46:08,236 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 03:46:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:08,253 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2018-11-23 03:46:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:46:08,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2018-11-23 03:46:08,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 03:46:08,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 20 transitions. [2018-11-23 03:46:08,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 03:46:08,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 03:46:08,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2018-11-23 03:46:08,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:46:08,256 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2018-11-23 03:46:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2018-11-23 03:46:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 03:46:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 03:46:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-11-23 03:46:08,258 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2018-11-23 03:46:08,258 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2018-11-23 03:46:08,258 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:46:08,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2018-11-23 03:46:08,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 03:46:08,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:08,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:08,259 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 03:46:08,259 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:46:08,259 INFO L794 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 62#L18-1 [2018-11-23 03:46:08,259 INFO L796 eck$LassoCheckResult]: Loop: 62#L18-1 assume !!(main_~i~0 > 0); 71#L12 assume !(1 == main_~i~0); 70#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 66#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 62#L18-1 [2018-11-23 03:46:08,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-11-23 03:46:08,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:08,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:08,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1236462, now seen corresponding path program 1 times [2018-11-23 03:46:08,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:08,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:08,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash 29865613, now seen corresponding path program 1 times [2018-11-23 03:46:08,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:08,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,315 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:08,316 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:08,316 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:08,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:08,317 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:08,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:08,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:08,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:08,317 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 03:46:08,317 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:08,317 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:08,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,444 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:08,444 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:08,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:08,449 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:08,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:08,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:08,481 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:08,498 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:08,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:08,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:08,499 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:08,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:08,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:08,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:08,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:08,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 03:46:08,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:08,499 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:08,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,564 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:08,568 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:08,569 INFO L122 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 [2018-11-23 03:46:08,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:08,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:08,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:08,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:08,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:08,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:08,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:08,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:08,585 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:08,585 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:46:08,587 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:08,587 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:08,588 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:08,588 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:46:08,589 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:08,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:08,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:08,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:08,645 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 [2018-11-23 03:46:08,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 03:46:08,701 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 43 transitions. Complement of second has 5 states. [2018-11-23 03:46:08,701 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 [2018-11-23 03:46:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:46:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-23 03:46:08,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-23 03:46:08,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:08,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 03:46:08,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:08,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2018-11-23 03:46:08,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:08,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2018-11-23 03:46:08,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 03:46:08,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 40 transitions. [2018-11-23 03:46:08,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 03:46:08,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 03:46:08,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 40 transitions. [2018-11-23 03:46:08,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:08,706 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-11-23 03:46:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 40 transitions. [2018-11-23 03:46:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 03:46:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 03:46:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2018-11-23 03:46:08,708 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-11-23 03:46:08,710 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-11-23 03:46:08,710 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:46:08,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2018-11-23 03:46:08,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 03:46:08,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:08,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:08,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:46:08,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:46:08,712 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 141#L18-1 assume !!(main_~i~0 > 0); 152#L12 assume 1 == main_~i~0;main_~up~0 := 1; 159#L12-2 assume !(10 == main_~i~0); 154#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 155#L18-1 [2018-11-23 03:46:08,712 INFO L796 eck$LassoCheckResult]: Loop: 155#L18-1 assume !!(main_~i~0 > 0); 161#L12 assume 1 == main_~i~0;main_~up~0 := 1; 136#L12-2 assume !(10 == main_~i~0); 137#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 155#L18-1 [2018-11-23 03:46:08,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,712 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2018-11-23 03:46:08,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:08,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:08,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2018-11-23 03:46:08,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:08,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:08,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:08,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1816490734, now seen corresponding path program 2 times [2018-11-23 03:46:08,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:08,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:08,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:08,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:46:08,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:46:08,778 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:08,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:08,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:08,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:08,778 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:08,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:08,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:08,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:08,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 03:46:08,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:08,779 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:08,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,834 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:08,834 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:08,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:08,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:08,873 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:08,873 INFO L448 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/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:08,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:08,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:08,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:08,896 INFO L448 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/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:08,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:08,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:08,903 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:08,903 INFO L448 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/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:08,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:08,923 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:08,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:08,960 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:08,965 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:08,980 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:08,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:08,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:08,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:08,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:08,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:08,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:08,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:08,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 03:46:08,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:08,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:08,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:08,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,034 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:09,034 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:09,035 INFO L122 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 [2018-11-23 03:46:09,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:09,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:09,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:09,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:09,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:46:09,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:46:09,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:09,042 INFO L122 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 [2018-11-23 03:46:09,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:09,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:09,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:09,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:09,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:09,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:09,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:09,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:09,047 INFO L122 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 [2018-11-23 03:46:09,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:09,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:09,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:09,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:09,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:46:09,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:46:09,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:09,056 INFO L122 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 [2018-11-23 03:46:09,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:09,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:09,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:09,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:09,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:09,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:09,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:09,062 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:09,066 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:09,066 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:46:09,067 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:09,067 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:09,067 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:09,067 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 3 Supporting invariants [] [2018-11-23 03:46:09,068 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:09,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:09,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:09,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:09,117 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 [2018-11-23 03:46:09,117 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-23 03:46:09,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 43 states and 64 transitions. Complement of second has 7 states. [2018-11-23 03:46:09,159 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 [2018-11-23 03:46:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:46:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 03:46:09,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 03:46:09,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:09,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 03:46:09,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:09,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 03:46:09,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:09,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 64 transitions. [2018-11-23 03:46:09,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-23 03:46:09,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 63 transitions. [2018-11-23 03:46:09,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 03:46:09,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 03:46:09,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 63 transitions. [2018-11-23 03:46:09,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:09,163 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2018-11-23 03:46:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 63 transitions. [2018-11-23 03:46:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 03:46:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 03:46:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2018-11-23 03:46:09,166 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2018-11-23 03:46:09,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:46:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:46:09,167 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 4 states. [2018-11-23 03:46:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:09,189 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-11-23 03:46:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:46:09,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 64 transitions. [2018-11-23 03:46:09,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-23 03:46:09,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 41 states and 59 transitions. [2018-11-23 03:46:09,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 03:46:09,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 03:46:09,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 59 transitions. [2018-11-23 03:46:09,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:09,192 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2018-11-23 03:46:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 59 transitions. [2018-11-23 03:46:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-11-23 03:46:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 03:46:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2018-11-23 03:46:09,195 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-11-23 03:46:09,195 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-11-23 03:46:09,195 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:46:09,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2018-11-23 03:46:09,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 03:46:09,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:09,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:09,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:46:09,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:46:09,197 INFO L794 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 348#L18-1 assume !!(main_~i~0 > 0); 352#L12 assume 1 == main_~i~0;main_~up~0 := 1; 343#L12-2 assume !(10 == main_~i~0); 344#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 363#L18-1 [2018-11-23 03:46:09,197 INFO L796 eck$LassoCheckResult]: Loop: 363#L18-1 assume !!(main_~i~0 > 0); 354#L12 assume !(1 == main_~i~0); 355#L12-2 assume !(10 == main_~i~0); 364#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 363#L18-1 [2018-11-23 03:46:09,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 3 times [2018-11-23 03:46:09,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:09,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:09,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:09,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2018-11-23 03:46:09,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:09,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:09,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:09,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:09,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:09,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1816492656, now seen corresponding path program 1 times [2018-11-23 03:46:09,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:09,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:09,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:09,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:09,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:09,243 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:09,243 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:09,243 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:09,243 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:09,244 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:09,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:09,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:09,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:09,244 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 03:46:09,244 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:09,244 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:09,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,356 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:09,356 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:09,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:09,364 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:09,367 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:09,367 INFO L448 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/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:09,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:09,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:09,403 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:09,403 INFO L448 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/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:09,406 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:09,406 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:09,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:09,429 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:09,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:09,441 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=15} Honda state: {ULTIMATE.start_main_~i~0=15} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~i~0=1}] Lambdas: [16, 0, 1] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:09,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:09,460 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:09,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:09,479 INFO L448 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: [] [2018-11-23 03:46:09,517 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:09,517 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:09,517 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:09,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:09,518 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:09,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:09,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:09,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:09,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration5_Lasso [2018-11-23 03:46:09,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:09,518 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:09,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,615 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:09,615 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:09,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:09,626 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:09,645 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:09,645 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:09,664 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:09,665 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:09,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:09,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:09,666 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:09,666 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:09,666 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:09,666 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:09,666 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:09,666 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration5_Lasso [2018-11-23 03:46:09,666 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:09,666 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:09,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:09,762 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:09,762 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:09,763 INFO L122 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 [2018-11-23 03:46:09,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:09,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:09,764 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:46:09,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:09,768 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 03:46:09,768 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 03:46:09,838 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:09,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:09,847 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:46:09,848 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:09,851 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-23 03:46:09,852 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:09,852 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0 + 10 >= 0] [2018-11-23 03:46:09,858 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 03:46:09,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:09,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:09,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:09,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:46:09,919 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-23 03:46:09,987 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 38 states and 55 transitions. Complement of second has 8 states. [2018-11-23 03:46:09,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 03:46:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 03:46:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 03:46:09,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 03:46:09,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:09,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 03:46:09,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:09,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 03:46:09,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:09,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. [2018-11-23 03:46:09,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 03:46:09,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 54 transitions. [2018-11-23 03:46:09,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 03:46:09,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 03:46:09,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 54 transitions. [2018-11-23 03:46:09,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:09,991 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 54 transitions. [2018-11-23 03:46:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 54 transitions. [2018-11-23 03:46:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 03:46:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 03:46:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2018-11-23 03:46:09,996 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-11-23 03:46:09,996 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-11-23 03:46:09,996 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:46:09,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 53 transitions. [2018-11-23 03:46:09,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 03:46:09,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:09,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:09,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 03:46:09,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:46:09,998 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 477#L18-1 assume !!(main_~i~0 > 0); 481#L12 assume 1 == main_~i~0;main_~up~0 := 1; 493#L12-2 assume !(10 == main_~i~0); 492#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 491#L18-1 assume !!(main_~i~0 > 0); 483#L12 assume !(1 == main_~i~0); 484#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 473#L15-1 [2018-11-23 03:46:09,998 INFO L796 eck$LassoCheckResult]: Loop: 473#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 478#L18-1 assume !!(main_~i~0 > 0); 479#L12 assume !(1 == main_~i~0); 472#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 473#L15-1 [2018-11-23 03:46:09,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash 612785863, now seen corresponding path program 1 times [2018-11-23 03:46:09,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:09,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:09,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:09,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:10,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:10,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:10,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:10,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:10,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:10,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-23 03:46:10,096 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:10,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1737972, now seen corresponding path program 2 times [2018-11-23 03:46:10,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:10,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:10,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:10,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:10,132 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:10,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:10,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:10,132 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:10,132 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:10,132 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:10,132 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:10,132 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:10,132 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 03:46:10,132 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:10,133 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:10,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:10,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:10,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:10,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:10,202 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:10,202 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:10,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:10,205 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:10,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:10,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:10,352 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:10,354 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:10,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:10,354 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:10,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:10,354 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:10,355 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:10,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:10,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:10,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 03:46:10,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:10,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:10,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:10,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:10,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:10,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:10,399 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:10,400 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:10,400 INFO L122 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 [2018-11-23 03:46:10,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:10,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:10,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:10,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:10,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:10,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:10,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:10,404 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:10,406 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:10,406 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:46:10,406 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:10,406 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:10,407 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:10,407 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:46:10,407 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:10,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:10,452 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 [2018-11-23 03:46:10,452 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-11-23 03:46:10,473 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 91 states and 135 transitions. Complement of second has 7 states. [2018-11-23 03:46:10,476 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 [2018-11-23 03:46:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:46:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 03:46:10,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 03:46:10,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:10,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-23 03:46:10,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:10,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-23 03:46:10,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:10,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 135 transitions. [2018-11-23 03:46:10,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2018-11-23 03:46:10,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 115 transitions. [2018-11-23 03:46:10,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-23 03:46:10,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-23 03:46:10,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 115 transitions. [2018-11-23 03:46:10,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:10,483 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 115 transitions. [2018-11-23 03:46:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 115 transitions. [2018-11-23 03:46:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 03:46:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 03:46:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2018-11-23 03:46:10,487 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 114 transitions. [2018-11-23 03:46:10,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:46:10,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:46:10,488 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand 4 states. [2018-11-23 03:46:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:10,504 INFO L93 Difference]: Finished difference Result 105 states and 148 transitions. [2018-11-23 03:46:10,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:46:10,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 148 transitions. [2018-11-23 03:46:10,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 03:46:10,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 148 transitions. [2018-11-23 03:46:10,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2018-11-23 03:46:10,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-11-23 03:46:10,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 148 transitions. [2018-11-23 03:46:10,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:10,508 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 148 transitions. [2018-11-23 03:46:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 148 transitions. [2018-11-23 03:46:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2018-11-23 03:46:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 03:46:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2018-11-23 03:46:10,514 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 130 transitions. [2018-11-23 03:46:10,514 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 130 transitions. [2018-11-23 03:46:10,514 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 03:46:10,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 130 transitions. [2018-11-23 03:46:10,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-23 03:46:10,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:10,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:10,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-23 03:46:10,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:46:10,516 INFO L794 eck$LassoCheckResult]: Stem: 867#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 868#L18-1 assume !!(main_~i~0 > 0); 905#L12 assume 1 == main_~i~0;main_~up~0 := 1; 904#L12-2 assume !(10 == main_~i~0); 903#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 901#L18-1 assume !!(main_~i~0 > 0); 902#L12 assume !(1 == main_~i~0); 914#L12-2 assume !(10 == main_~i~0); 912#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 890#L18-1 [2018-11-23 03:46:10,516 INFO L796 eck$LassoCheckResult]: Loop: 890#L18-1 assume !!(main_~i~0 > 0); 908#L12 assume 1 == main_~i~0;main_~up~0 := 1; 899#L12-2 assume !(10 == main_~i~0); 897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 890#L18-1 [2018-11-23 03:46:10,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1816492658, now seen corresponding path program 1 times [2018-11-23 03:46:10,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:10,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 03:46:10,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:46:10,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:46:10,535 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:10,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2018-11-23 03:46:10,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:10,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:10,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:10,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:46:10,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:46:10,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:46:10,549 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:46:10,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:46:10,550 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. cyclomatic complexity: 49 Second operand 3 states. [2018-11-23 03:46:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:10,558 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-11-23 03:46:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:46:10,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2018-11-23 03:46:10,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 03:46:10,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 51 states and 63 transitions. [2018-11-23 03:46:10,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-23 03:46:10,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 03:46:10,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2018-11-23 03:46:10,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:10,560 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-23 03:46:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2018-11-23 03:46:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 03:46:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 03:46:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-23 03:46:10,564 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-23 03:46:10,564 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-23 03:46:10,564 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 03:46:10,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 60 transitions. [2018-11-23 03:46:10,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 03:46:10,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:10,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:10,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 03:46:10,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2018-11-23 03:46:10,565 INFO L794 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1031#L18-1 assume !!(main_~i~0 > 0); 1061#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1059#L12-2 assume !(10 == main_~i~0); 1057#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1055#L18-1 assume !!(main_~i~0 > 0); 1048#L12 assume !(1 == main_~i~0); 1051#L12-2 assume !(10 == main_~i~0); 1049#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1047#L18-1 assume !!(main_~i~0 > 0); 1046#L12 assume !(1 == main_~i~0); 1045#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1044#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1034#L18-1 assume !!(main_~i~0 > 0); 1035#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1026#L12-2 [2018-11-23 03:46:10,566 INFO L796 eck$LassoCheckResult]: Loop: 1026#L12-2 assume !(10 == main_~i~0); 1027#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1068#L18-1 assume !!(main_~i~0 > 0); 1036#L12 assume !(1 == main_~i~0); 1037#L12-2 assume !(10 == main_~i~0); 1073#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1032#L18-1 assume !!(main_~i~0 > 0); 1033#L12 assume !(1 == main_~i~0); 1072#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1040#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1041#L18-1 assume !!(main_~i~0 > 0); 1071#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1026#L12-2 [2018-11-23 03:46:10,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1399375584, now seen corresponding path program 1 times [2018-11-23 03:46:10,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:10,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 03:46:10,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:46:10,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:46:10,579 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:10,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,579 INFO L82 PathProgramCache]: Analyzing trace with hash 388845694, now seen corresponding path program 1 times [2018-11-23 03:46:10,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:10,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:10,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:46:10,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:46:10,598 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:10,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:46:10,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:46:10,599 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. cyclomatic complexity: 18 Second operand 4 states. [2018-11-23 03:46:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:10,618 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2018-11-23 03:46:10,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:46:10,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 79 transitions. [2018-11-23 03:46:10,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-23 03:46:10,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 78 transitions. [2018-11-23 03:46:10,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 03:46:10,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 03:46:10,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 78 transitions. [2018-11-23 03:46:10,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:10,621 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 78 transitions. [2018-11-23 03:46:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 78 transitions. [2018-11-23 03:46:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-11-23 03:46:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 03:46:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-23 03:46:10,623 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-23 03:46:10,623 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-23 03:46:10,623 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 03:46:10,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 68 transitions. [2018-11-23 03:46:10,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 03:46:10,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:10,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:10,625 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 3, 2, 2, 2, 1, 1] [2018-11-23 03:46:10,625 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2018-11-23 03:46:10,625 INFO L794 eck$LassoCheckResult]: Stem: 1152#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1153#L18-1 assume !!(main_~i~0 > 0); 1182#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1180#L12-2 assume !(10 == main_~i~0); 1178#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1176#L18-1 assume !!(main_~i~0 > 0); 1169#L12 assume !(1 == main_~i~0); 1172#L12-2 assume !(10 == main_~i~0); 1170#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1168#L18-1 assume !!(main_~i~0 > 0); 1167#L12 assume !(1 == main_~i~0); 1166#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1160#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1161#L18-1 assume !!(main_~i~0 > 0); 1159#L12 assume !(1 == main_~i~0); 1149#L12-2 assume !(10 == main_~i~0); 1151#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1156#L18-1 assume !!(main_~i~0 > 0); 1157#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1191#L12-2 [2018-11-23 03:46:10,625 INFO L796 eck$LassoCheckResult]: Loop: 1191#L12-2 assume !(10 == main_~i~0); 1162#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1154#L18-1 assume !!(main_~i~0 > 0); 1155#L12 assume !(1 == main_~i~0); 1158#L12-2 assume !(10 == main_~i~0); 1197#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1200#L18-1 assume !!(main_~i~0 > 0); 1199#L12 assume !(1 == main_~i~0); 1196#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1148#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1163#L18-1 assume !!(main_~i~0 > 0); 1194#L12 assume !(1 == main_~i~0); 1195#L12-2 assume !(10 == main_~i~0); 1198#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1202#L18-1 assume !!(main_~i~0 > 0); 1201#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1191#L12-2 [2018-11-23 03:46:10,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1376811083, now seen corresponding path program 2 times [2018-11-23 03:46:10,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:10,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:10,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 03:46:10,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:10,647 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:10,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:46:10,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:46:10,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:10,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 03:46:10,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:10,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 03:46:10,693 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:10,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash 656081641, now seen corresponding path program 2 times [2018-11-23 03:46:10,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:10,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:10,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:10,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:10,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:46:10,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:46:10,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:10,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:10,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:10,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 03:46:10,776 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:10,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:46:10,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:46:10,776 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-23 03:46:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:10,803 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 03:46:10,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:46:10,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 94 transitions. [2018-11-23 03:46:10,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-23 03:46:10,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 93 transitions. [2018-11-23 03:46:10,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-23 03:46:10,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-23 03:46:10,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 93 transitions. [2018-11-23 03:46:10,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:10,806 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2018-11-23 03:46:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 93 transitions. [2018-11-23 03:46:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-11-23 03:46:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 03:46:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-11-23 03:46:10,809 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-11-23 03:46:10,809 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-11-23 03:46:10,810 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 03:46:10,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 83 transitions. [2018-11-23 03:46:10,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-23 03:46:10,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:10,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:10,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 4, 3, 2, 2, 1, 1] [2018-11-23 03:46:10,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2018-11-23 03:46:10,812 INFO L794 eck$LassoCheckResult]: Stem: 1394#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; 1395#L18-1 assume !!(main_~i~0 > 0); 1419#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1418#L12-2 assume !(10 == main_~i~0); 1417#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1416#L18-1 assume !!(main_~i~0 > 0); 1413#L12 assume !(1 == main_~i~0); 1415#L12-2 assume !(10 == main_~i~0); 1414#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1412#L18-1 assume !!(main_~i~0 > 0); 1411#L12 assume !(1 == main_~i~0); 1410#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1403#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1404#L18-1 assume !!(main_~i~0 > 0); 1454#L12 assume !(1 == main_~i~0); 1453#L12-2 assume !(10 == main_~i~0); 1452#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1451#L18-1 assume !!(main_~i~0 > 0); 1450#L12 assume !(1 == main_~i~0); 1430#L12-2 assume !(10 == main_~i~0); 1436#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1435#L18-1 assume !!(main_~i~0 > 0); 1428#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1429#L12-2 [2018-11-23 03:46:10,812 INFO L796 eck$LassoCheckResult]: Loop: 1429#L12-2 assume !(10 == main_~i~0); 1440#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1437#L18-1 assume !!(main_~i~0 > 0); 1431#L12 assume !(1 == main_~i~0); 1432#L12-2 assume !(10 == main_~i~0); 1425#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1434#L18-1 assume !!(main_~i~0 > 0); 1427#L12 assume !(1 == main_~i~0); 1424#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1390#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1446#L18-1 assume !!(main_~i~0 > 0); 1447#L12 assume !(1 == main_~i~0); 1448#L12-2 assume !(10 == main_~i~0); 1407#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1408#L18-1 assume !!(main_~i~0 > 0); 1400#L12 assume !(1 == main_~i~0); 1401#L12-2 assume !(10 == main_~i~0); 1426#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1396#L18-1 assume !!(main_~i~0 > 0); 1397#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1429#L12-2 [2018-11-23 03:46:10,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1767603254, now seen corresponding path program 3 times [2018-11-23 03:46:10,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:10,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 03:46:10,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:10,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:46:10,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 03:46:10,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:10,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 03:46:10,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:10,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-11-23 03:46:10,899 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:10,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1254328276, now seen corresponding path program 3 times [2018-11-23 03:46:10,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:10,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:10,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:10,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:10,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:46:10,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 03:46:10,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:10,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:10,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 03:46:10,994 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:10,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:46:10,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:46:10,994 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. cyclomatic complexity: 21 Second operand 6 states. [2018-11-23 03:46:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:11,020 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2018-11-23 03:46:11,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:46:11,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 109 transitions. [2018-11-23 03:46:11,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-23 03:46:11,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 108 transitions. [2018-11-23 03:46:11,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-23 03:46:11,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-23 03:46:11,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 108 transitions. [2018-11-23 03:46:11,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:11,024 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 108 transitions. [2018-11-23 03:46:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 108 transitions. [2018-11-23 03:46:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2018-11-23 03:46:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 03:46:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2018-11-23 03:46:11,028 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 98 transitions. [2018-11-23 03:46:11,028 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 98 transitions. [2018-11-23 03:46:11,029 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 03:46:11,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 98 transitions. [2018-11-23 03:46:11,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 03:46:11,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:11,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:11,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1] [2018-11-23 03:46:11,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2018-11-23 03:46:11,031 INFO L794 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 !!(main_~i~0 > 0); 1713#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1712#L12-2 assume !(10 == main_~i~0); 1711#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1710#L18-1 assume !!(main_~i~0 > 0); 1707#L12 assume !(1 == main_~i~0); 1709#L12-2 assume !(10 == main_~i~0); 1708#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1706#L18-1 assume !!(main_~i~0 > 0); 1705#L12 assume !(1 == main_~i~0); 1704#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1697#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1698#L18-1 assume !!(main_~i~0 > 0); 1744#L12 assume !(1 == main_~i~0); 1743#L12-2 assume !(10 == main_~i~0); 1742#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1741#L18-1 assume !!(main_~i~0 > 0); 1740#L12 assume !(1 == main_~i~0); 1739#L12-2 assume !(10 == main_~i~0); 1738#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1737#L18-1 assume !!(main_~i~0 > 0); 1736#L12 assume !(1 == main_~i~0); 1721#L12-2 assume !(10 == main_~i~0); 1725#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1724#L18-1 assume !!(main_~i~0 > 0); 1720#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1702#L12-2 [2018-11-23 03:46:11,031 INFO L796 eck$LassoCheckResult]: Loop: 1702#L12-2 assume !(10 == main_~i~0); 1703#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1755#L18-1 assume !!(main_~i~0 > 0); 1722#L12 assume !(1 == main_~i~0); 1723#L12-2 assume !(10 == main_~i~0); 1734#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1731#L18-1 assume !!(main_~i~0 > 0); 1732#L12 assume !(1 == main_~i~0); 1752#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1685#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1701#L18-1 assume !!(main_~i~0 > 0); 1754#L12 assume !(1 == main_~i~0); 1753#L12-2 assume !(10 == main_~i~0); 1751#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1750#L18-1 assume !!(main_~i~0 > 0); 1749#L12 assume !(1 == main_~i~0); 1748#L12-2 assume !(10 == main_~i~0); 1747#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1746#L18-1 assume !!(main_~i~0 > 0); 1745#L12 assume !(1 == main_~i~0); 1719#L12-2 assume !(10 == main_~i~0); 1729#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1726#L18-1 assume !!(main_~i~0 > 0); 1718#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1702#L12-2 [2018-11-23 03:46:11,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:11,031 INFO L82 PathProgramCache]: Analyzing trace with hash 442274465, now seen corresponding path program 4 times [2018-11-23 03:46:11,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:11,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:11,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:11,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 03:46:11,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:11,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:11,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:46:11,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:46:11,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:11,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 03:46:11,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:11,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 03:46:11,092 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:11,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1418092737, now seen corresponding path program 4 times [2018-11-23 03:46:11,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:11,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:11,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:11,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:11,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:46:11,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:46:11,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:11,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:11,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:11,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 03:46:11,183 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:11,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:46:11,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:46:11,184 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. cyclomatic complexity: 24 Second operand 7 states. [2018-11-23 03:46:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:11,215 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2018-11-23 03:46:11,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:46:11,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 124 transitions. [2018-11-23 03:46:11,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-23 03:46:11,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 99 states and 123 transitions. [2018-11-23 03:46:11,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-23 03:46:11,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-23 03:46:11,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 123 transitions. [2018-11-23 03:46:11,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:11,217 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 123 transitions. [2018-11-23 03:46:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 123 transitions. [2018-11-23 03:46:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2018-11-23 03:46:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 03:46:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2018-11-23 03:46:11,219 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 113 transitions. [2018-11-23 03:46:11,219 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 113 transitions. [2018-11-23 03:46:11,219 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 03:46:11,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 113 transitions. [2018-11-23 03:46:11,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-23 03:46:11,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:11,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:11,220 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 6, 6, 5, 2, 2, 1, 1] [2018-11-23 03:46:11,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2018-11-23 03:46:11,220 INFO L794 eck$LassoCheckResult]: Stem: 2029#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; 2030#L18-1 assume !!(main_~i~0 > 0); 2052#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2051#L12-2 assume !(10 == main_~i~0); 2050#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2049#L18-1 assume !!(main_~i~0 > 0); 2046#L12 assume !(1 == main_~i~0); 2048#L12-2 assume !(10 == main_~i~0); 2047#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2045#L18-1 assume !!(main_~i~0 > 0); 2044#L12 assume !(1 == main_~i~0); 2043#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2037#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2038#L18-1 assume !!(main_~i~0 > 0); 2086#L12 assume !(1 == main_~i~0); 2085#L12-2 assume !(10 == main_~i~0); 2084#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2083#L18-1 assume !!(main_~i~0 > 0); 2082#L12 assume !(1 == main_~i~0); 2081#L12-2 assume !(10 == main_~i~0); 2080#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2079#L18-1 assume !!(main_~i~0 > 0); 2078#L12 assume !(1 == main_~i~0); 2077#L12-2 assume !(10 == main_~i~0); 2076#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2075#L18-1 assume !!(main_~i~0 > 0); 2074#L12 assume !(1 == main_~i~0); 2060#L12-2 assume !(10 == main_~i~0); 2064#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2063#L18-1 assume !!(main_~i~0 > 0); 2059#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2041#L12-2 [2018-11-23 03:46:11,221 INFO L796 eck$LassoCheckResult]: Loop: 2041#L12-2 assume !(10 == main_~i~0); 2042#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2071#L18-1 assume !!(main_~i~0 > 0); 2061#L12 assume !(1 == main_~i~0); 2062#L12-2 assume !(10 == main_~i~0); 2112#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2115#L18-1 assume !!(main_~i~0 > 0); 2114#L12 assume !(1 == main_~i~0); 2111#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2025#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2040#L18-1 assume !!(main_~i~0 > 0); 2035#L12 assume !(1 == main_~i~0); 2036#L12-2 assume !(10 == main_~i~0); 2098#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2097#L18-1 assume !!(main_~i~0 > 0); 2096#L12 assume !(1 == main_~i~0); 2095#L12-2 assume !(10 == main_~i~0); 2094#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2093#L18-1 assume !!(main_~i~0 > 0); 2092#L12 assume !(1 == main_~i~0); 2091#L12-2 assume !(10 == main_~i~0); 2090#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2089#L18-1 assume !!(main_~i~0 > 0); 2088#L12 assume !(1 == main_~i~0); 2058#L12-2 assume !(10 == main_~i~0); 2070#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2068#L18-1 assume !!(main_~i~0 > 0); 2057#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2041#L12-2 [2018-11-23 03:46:11,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:11,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1631159412, now seen corresponding path program 5 times [2018-11-23 03:46:11,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:11,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 03:46:11,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:11,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:11,272 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 03:46:11,281 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 03:46:11,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:11,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 03:46:11,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:11,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 03:46:11,305 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:11,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:11,305 INFO L82 PathProgramCache]: Analyzing trace with hash 187697450, now seen corresponding path program 5 times [2018-11-23 03:46:11,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:11,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:11,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:11,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:11,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:11,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:11,359 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 03:46:11,367 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 03:46:11,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:11,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:11,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:11,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 03:46:11,395 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:46:11,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:46:11,395 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. cyclomatic complexity: 27 Second operand 8 states. [2018-11-23 03:46:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:11,455 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2018-11-23 03:46:11,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:46:11,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 139 transitions. [2018-11-23 03:46:11,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-23 03:46:11,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 111 states and 138 transitions. [2018-11-23 03:46:11,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-23 03:46:11,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-23 03:46:11,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 138 transitions. [2018-11-23 03:46:11,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:11,458 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 138 transitions. [2018-11-23 03:46:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 138 transitions. [2018-11-23 03:46:11,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-11-23 03:46:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 03:46:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2018-11-23 03:46:11,460 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 128 transitions. [2018-11-23 03:46:11,460 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 128 transitions. [2018-11-23 03:46:11,460 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 03:46:11,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 128 transitions. [2018-11-23 03:46:11,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-11-23 03:46:11,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:11,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:11,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 7, 7, 6, 2, 2, 1, 1] [2018-11-23 03:46:11,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2018-11-23 03:46:11,463 INFO L794 eck$LassoCheckResult]: Stem: 2418#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; 2419#L18-1 assume !!(main_~i~0 > 0); 2442#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2441#L12-2 assume !(10 == main_~i~0); 2440#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2439#L18-1 assume !!(main_~i~0 > 0); 2436#L12 assume !(1 == main_~i~0); 2438#L12-2 assume !(10 == main_~i~0); 2437#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2435#L18-1 assume !!(main_~i~0 > 0); 2434#L12 assume !(1 == main_~i~0); 2433#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2427#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2428#L18-1 assume !!(main_~i~0 > 0); 2482#L12 assume !(1 == main_~i~0); 2481#L12-2 assume !(10 == main_~i~0); 2480#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2479#L18-1 assume !!(main_~i~0 > 0); 2478#L12 assume !(1 == main_~i~0); 2477#L12-2 assume !(10 == main_~i~0); 2476#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2475#L18-1 assume !!(main_~i~0 > 0); 2474#L12 assume !(1 == main_~i~0); 2473#L12-2 assume !(10 == main_~i~0); 2472#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2471#L18-1 assume !!(main_~i~0 > 0); 2470#L12 assume !(1 == main_~i~0); 2469#L12-2 assume !(10 == main_~i~0); 2468#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2467#L18-1 assume !!(main_~i~0 > 0); 2466#L12 assume !(1 == main_~i~0); 2450#L12-2 assume !(10 == main_~i~0); 2454#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2453#L18-1 assume !!(main_~i~0 > 0); 2449#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2431#L12-2 [2018-11-23 03:46:11,463 INFO L796 eck$LassoCheckResult]: Loop: 2431#L12-2 assume !(10 == main_~i~0); 2432#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2461#L18-1 assume !!(main_~i~0 > 0); 2451#L12 assume !(1 == main_~i~0); 2452#L12-2 assume !(10 == main_~i~0); 2463#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2464#L18-1 assume !!(main_~i~0 > 0); 2507#L12 assume !(1 == main_~i~0); 2505#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2414#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2430#L18-1 assume !!(main_~i~0 > 0); 2424#L12 assume !(1 == main_~i~0); 2425#L12-2 assume !(10 == main_~i~0); 2498#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2497#L18-1 assume !!(main_~i~0 > 0); 2496#L12 assume !(1 == main_~i~0); 2495#L12-2 assume !(10 == main_~i~0); 2494#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2493#L18-1 assume !!(main_~i~0 > 0); 2492#L12 assume !(1 == main_~i~0); 2491#L12-2 assume !(10 == main_~i~0); 2490#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2489#L18-1 assume !!(main_~i~0 > 0); 2488#L12 assume !(1 == main_~i~0); 2487#L12-2 assume !(10 == main_~i~0); 2486#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2485#L18-1 assume !!(main_~i~0 > 0); 2484#L12 assume !(1 == main_~i~0); 2448#L12-2 assume !(10 == main_~i~0); 2460#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2458#L18-1 assume !!(main_~i~0 > 0); 2447#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2431#L12-2 [2018-11-23 03:46:11,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1729366281, now seen corresponding path program 6 times [2018-11-23 03:46:11,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 03:46:11,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:11,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:11,501 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 03:46:11,509 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 03:46:11,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:11,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 63 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 03:46:11,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:11,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2018-11-23 03:46:11,581 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:11,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1954121109, now seen corresponding path program 6 times [2018-11-23 03:46:11,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:11,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:11,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:11,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:11,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:11,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:11,664 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 03:46:11,684 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 03:46:11,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:11,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:11,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:11,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 03:46:11,710 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:11,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 03:46:11,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:46:11,710 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. cyclomatic complexity: 30 Second operand 9 states. [2018-11-23 03:46:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:11,749 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2018-11-23 03:46:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:46:11,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 154 transitions. [2018-11-23 03:46:11,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-23 03:46:11,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 123 states and 153 transitions. [2018-11-23 03:46:11,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-23 03:46:11,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-23 03:46:11,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 153 transitions. [2018-11-23 03:46:11,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:11,752 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. [2018-11-23 03:46:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 153 transitions. [2018-11-23 03:46:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-11-23 03:46:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 03:46:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2018-11-23 03:46:11,755 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2018-11-23 03:46:11,755 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2018-11-23 03:46:11,755 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 03:46:11,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 143 transitions. [2018-11-23 03:46:11,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-23 03:46:11,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:11,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:11,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 8, 8, 7, 2, 2, 1, 1] [2018-11-23 03:46:11,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2018-11-23 03:46:11,759 INFO L794 eck$LassoCheckResult]: Stem: 2863#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; 2864#L18-1 assume !!(main_~i~0 > 0); 2885#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2884#L12-2 assume !(10 == main_~i~0); 2883#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2882#L18-1 assume !!(main_~i~0 > 0); 2879#L12 assume !(1 == main_~i~0); 2881#L12-2 assume !(10 == main_~i~0); 2880#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2878#L18-1 assume !!(main_~i~0 > 0); 2877#L12 assume !(1 == main_~i~0); 2876#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2870#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2871#L18-1 assume !!(main_~i~0 > 0); 2928#L12 assume !(1 == main_~i~0); 2927#L12-2 assume !(10 == main_~i~0); 2926#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2925#L18-1 assume !!(main_~i~0 > 0); 2924#L12 assume !(1 == main_~i~0); 2923#L12-2 assume !(10 == main_~i~0); 2922#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2921#L18-1 assume !!(main_~i~0 > 0); 2920#L12 assume !(1 == main_~i~0); 2919#L12-2 assume !(10 == main_~i~0); 2918#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2917#L18-1 assume !!(main_~i~0 > 0); 2916#L12 assume !(1 == main_~i~0); 2915#L12-2 assume !(10 == main_~i~0); 2914#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2913#L18-1 assume !!(main_~i~0 > 0); 2912#L12 assume !(1 == main_~i~0); 2911#L12-2 assume !(10 == main_~i~0); 2910#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2909#L18-1 assume !!(main_~i~0 > 0); 2908#L12 assume !(1 == main_~i~0); 2894#L12-2 assume !(10 == main_~i~0); 2897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2896#L18-1 assume !!(main_~i~0 > 0); 2893#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2891#L12-2 [2018-11-23 03:46:11,759 INFO L796 eck$LassoCheckResult]: Loop: 2891#L12-2 assume !(10 == main_~i~0); 2906#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2904#L18-1 assume !!(main_~i~0 > 0); 2895#L12 assume !(1 == main_~i~0); 2874#L12-2 assume !(10 == main_~i~0); 2875#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2953#L18-1 assume !!(main_~i~0 > 0); 2951#L12 assume !(1 == main_~i~0); 2949#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2859#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2873#L18-1 assume !!(main_~i~0 > 0); 2952#L12 assume !(1 == main_~i~0); 2950#L12-2 assume !(10 == main_~i~0); 2948#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2947#L18-1 assume !!(main_~i~0 > 0); 2946#L12 assume !(1 == main_~i~0); 2945#L12-2 assume !(10 == main_~i~0); 2944#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2943#L18-1 assume !!(main_~i~0 > 0); 2942#L12 assume !(1 == main_~i~0); 2941#L12-2 assume !(10 == main_~i~0); 2940#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2939#L18-1 assume !!(main_~i~0 > 0); 2938#L12 assume !(1 == main_~i~0); 2937#L12-2 assume !(10 == main_~i~0); 2936#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2935#L18-1 assume !!(main_~i~0 > 0); 2934#L12 assume !(1 == main_~i~0); 2933#L12-2 assume !(10 == main_~i~0); 2932#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2931#L18-1 assume !!(main_~i~0 > 0); 2930#L12 assume !(1 == main_~i~0); 2892#L12-2 assume !(10 == main_~i~0); 2902#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2898#L18-1 assume !!(main_~i~0 > 0); 2890#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2891#L12-2 [2018-11-23 03:46:11,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:11,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1010842398, now seen corresponding path program 7 times [2018-11-23 03:46:11,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:11,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:11,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:11,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 03:46:11,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:11,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:11,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 03:46:11,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:11,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 03:46:11,834 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:11,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:11,835 INFO L82 PathProgramCache]: Analyzing trace with hash -360131456, now seen corresponding path program 7 times [2018-11-23 03:46:11,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:11,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:11,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:11,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:11,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:11,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:11,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:11,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:11,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:11,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 03:46:11,946 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:46:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:46:11,947 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. cyclomatic complexity: 33 Second operand 10 states. [2018-11-23 03:46:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:12,011 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2018-11-23 03:46:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 03:46:12,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 169 transitions. [2018-11-23 03:46:12,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-11-23 03:46:12,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 135 states and 168 transitions. [2018-11-23 03:46:12,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-23 03:46:12,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-23 03:46:12,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 168 transitions. [2018-11-23 03:46:12,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:12,014 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 168 transitions. [2018-11-23 03:46:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 168 transitions. [2018-11-23 03:46:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-11-23 03:46:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 03:46:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2018-11-23 03:46:12,017 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 158 transitions. [2018-11-23 03:46:12,017 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 158 transitions. [2018-11-23 03:46:12,017 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 03:46:12,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 158 transitions. [2018-11-23 03:46:12,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-23 03:46:12,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:12,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:12,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 9, 8, 2, 2, 1, 1] [2018-11-23 03:46:12,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2018-11-23 03:46:12,019 INFO L794 eck$LassoCheckResult]: Stem: 3350#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; 3351#L18-1 assume !!(main_~i~0 > 0); 3372#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3371#L12-2 assume !(10 == main_~i~0); 3370#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3369#L18-1 assume !!(main_~i~0 > 0); 3366#L12 assume !(1 == main_~i~0); 3368#L12-2 assume !(10 == main_~i~0); 3367#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3365#L18-1 assume !!(main_~i~0 > 0); 3364#L12 assume !(1 == main_~i~0); 3363#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3357#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3358#L18-1 assume !!(main_~i~0 > 0); 3419#L12 assume !(1 == main_~i~0); 3418#L12-2 assume !(10 == main_~i~0); 3417#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3416#L18-1 assume !!(main_~i~0 > 0); 3415#L12 assume !(1 == main_~i~0); 3414#L12-2 assume !(10 == main_~i~0); 3413#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3412#L18-1 assume !!(main_~i~0 > 0); 3411#L12 assume !(1 == main_~i~0); 3410#L12-2 assume !(10 == main_~i~0); 3409#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3408#L18-1 assume !!(main_~i~0 > 0); 3407#L12 assume !(1 == main_~i~0); 3406#L12-2 assume !(10 == main_~i~0); 3405#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3404#L18-1 assume !!(main_~i~0 > 0); 3403#L12 assume !(1 == main_~i~0); 3402#L12-2 assume !(10 == main_~i~0); 3401#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3400#L18-1 assume !!(main_~i~0 > 0); 3399#L12 assume !(1 == main_~i~0); 3398#L12-2 assume !(10 == main_~i~0); 3397#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3396#L18-1 assume !!(main_~i~0 > 0); 3395#L12 assume !(1 == main_~i~0); 3381#L12-2 assume !(10 == main_~i~0); 3384#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3383#L18-1 assume !!(main_~i~0 > 0); 3380#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3378#L12-2 [2018-11-23 03:46:12,019 INFO L796 eck$LassoCheckResult]: Loop: 3378#L12-2 assume !(10 == main_~i~0); 3393#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3391#L18-1 assume !!(main_~i~0 > 0); 3382#L12 assume !(1 == main_~i~0); 3361#L12-2 assume !(10 == main_~i~0); 3362#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3448#L18-1 assume !!(main_~i~0 > 0); 3446#L12 assume !(1 == main_~i~0); 3444#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3346#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3360#L18-1 assume !!(main_~i~0 > 0); 3447#L12 assume !(1 == main_~i~0); 3445#L12-2 assume !(10 == main_~i~0); 3443#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3442#L18-1 assume !!(main_~i~0 > 0); 3441#L12 assume !(1 == main_~i~0); 3440#L12-2 assume !(10 == main_~i~0); 3439#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3438#L18-1 assume !!(main_~i~0 > 0); 3437#L12 assume !(1 == main_~i~0); 3436#L12-2 assume !(10 == main_~i~0); 3435#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3434#L18-1 assume !!(main_~i~0 > 0); 3433#L12 assume !(1 == main_~i~0); 3432#L12-2 assume !(10 == main_~i~0); 3431#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3430#L18-1 assume !!(main_~i~0 > 0); 3429#L12 assume !(1 == main_~i~0); 3428#L12-2 assume !(10 == main_~i~0); 3427#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3426#L18-1 assume !!(main_~i~0 > 0); 3425#L12 assume !(1 == main_~i~0); 3424#L12-2 assume !(10 == main_~i~0); 3423#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3422#L18-1 assume !!(main_~i~0 > 0); 3421#L12 assume !(1 == main_~i~0); 3379#L12-2 assume !(10 == main_~i~0); 3389#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3385#L18-1 assume !!(main_~i~0 > 0); 3377#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3378#L12-2 [2018-11-23 03:46:12,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1563122355, now seen corresponding path program 8 times [2018-11-23 03:46:12,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:12,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:12,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 03:46:12,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:12,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:12,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:46:12,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:46:12,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:12,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 03:46:12,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:12,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 03:46:12,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:12,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:12,109 INFO L82 PathProgramCache]: Analyzing trace with hash 422622699, now seen corresponding path program 8 times [2018-11-23 03:46:12,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:12,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:12,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:12,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:12,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:12,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:46:12,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:46:12,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:12,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 03:46:12,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:12,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 03:46:12,245 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:46:12,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:46:12,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:46:12,245 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. cyclomatic complexity: 36 Second operand 11 states. [2018-11-23 03:46:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:12,305 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2018-11-23 03:46:12,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 03:46:12,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 184 transitions. [2018-11-23 03:46:12,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2018-11-23 03:46:12,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 147 states and 183 transitions. [2018-11-23 03:46:12,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-23 03:46:12,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-23 03:46:12,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 183 transitions. [2018-11-23 03:46:12,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:12,308 INFO L705 BuchiCegarLoop]: Abstraction has 147 states and 183 transitions. [2018-11-23 03:46:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 183 transitions. [2018-11-23 03:46:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2018-11-23 03:46:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 03:46:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2018-11-23 03:46:12,311 INFO L728 BuchiCegarLoop]: Abstraction has 140 states and 173 transitions. [2018-11-23 03:46:12,311 INFO L608 BuchiCegarLoop]: Abstraction has 140 states and 173 transitions. [2018-11-23 03:46:12,311 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 03:46:12,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 173 transitions. [2018-11-23 03:46:12,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2018-11-23 03:46:12,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:12,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:12,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 2, 1, 1] [2018-11-23 03:46:12,314 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2018-11-23 03:46:12,314 INFO L794 eck$LassoCheckResult]: Stem: 3886#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; 3887#L18-1 assume !!(main_~i~0 > 0); 3910#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3909#L12-2 assume !(10 == main_~i~0); 3908#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3907#L18-1 assume !!(main_~i~0 > 0); 3904#L12 assume !(1 == main_~i~0); 3906#L12-2 assume !(10 == main_~i~0); 3905#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3903#L18-1 assume !!(main_~i~0 > 0); 3902#L12 assume !(1 == main_~i~0); 3901#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3895#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3896#L18-1 assume !!(main_~i~0 > 0); 3962#L12 assume !(1 == main_~i~0); 3961#L12-2 assume !(10 == main_~i~0); 3960#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3959#L18-1 assume !!(main_~i~0 > 0); 3958#L12 assume !(1 == main_~i~0); 3957#L12-2 assume !(10 == main_~i~0); 3956#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3955#L18-1 assume !!(main_~i~0 > 0); 3954#L12 assume !(1 == main_~i~0); 3953#L12-2 assume !(10 == main_~i~0); 3952#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3951#L18-1 assume !!(main_~i~0 > 0); 3950#L12 assume !(1 == main_~i~0); 3949#L12-2 assume !(10 == main_~i~0); 3948#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3947#L18-1 assume !!(main_~i~0 > 0); 3946#L12 assume !(1 == main_~i~0); 3945#L12-2 assume !(10 == main_~i~0); 3944#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3943#L18-1 assume !!(main_~i~0 > 0); 3942#L12 assume !(1 == main_~i~0); 3941#L12-2 assume !(10 == main_~i~0); 3940#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3939#L18-1 assume !!(main_~i~0 > 0); 3938#L12 assume !(1 == main_~i~0); 3937#L12-2 assume !(10 == main_~i~0); 3936#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3935#L18-1 assume !!(main_~i~0 > 0); 3934#L12 assume !(1 == main_~i~0); 3918#L12-2 assume !(10 == main_~i~0); 3922#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3921#L18-1 assume !!(main_~i~0 > 0); 3917#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3899#L12-2 [2018-11-23 03:46:12,314 INFO L796 eck$LassoCheckResult]: Loop: 3899#L12-2 assume !(10 == main_~i~0); 3900#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3929#L18-1 assume !!(main_~i~0 > 0); 3919#L12 assume !(1 == main_~i~0); 3920#L12-2 assume !(10 == main_~i~0); 3931#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3932#L18-1 assume !!(main_~i~0 > 0); 3999#L12 assume !(1 == main_~i~0); 3997#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3882#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3898#L18-1 assume !!(main_~i~0 > 0); 3892#L12 assume !(1 == main_~i~0); 3893#L12-2 assume !(10 == main_~i~0); 3990#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3989#L18-1 assume !!(main_~i~0 > 0); 3988#L12 assume !(1 == main_~i~0); 3987#L12-2 assume !(10 == main_~i~0); 3986#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3985#L18-1 assume !!(main_~i~0 > 0); 3984#L12 assume !(1 == main_~i~0); 3983#L12-2 assume !(10 == main_~i~0); 3982#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3981#L18-1 assume !!(main_~i~0 > 0); 3980#L12 assume !(1 == main_~i~0); 3979#L12-2 assume !(10 == main_~i~0); 3978#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3977#L18-1 assume !!(main_~i~0 > 0); 3976#L12 assume !(1 == main_~i~0); 3975#L12-2 assume !(10 == main_~i~0); 3974#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3973#L18-1 assume !!(main_~i~0 > 0); 3972#L12 assume !(1 == main_~i~0); 3971#L12-2 assume !(10 == main_~i~0); 3970#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3969#L18-1 assume !!(main_~i~0 > 0); 3968#L12 assume !(1 == main_~i~0); 3967#L12-2 assume !(10 == main_~i~0); 3966#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3965#L18-1 assume !!(main_~i~0 > 0); 3964#L12 assume !(1 == main_~i~0); 3916#L12-2 assume !(10 == main_~i~0); 3928#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3926#L18-1 assume !!(main_~i~0 > 0); 3915#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3899#L12-2 [2018-11-23 03:46:12,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:12,314 INFO L82 PathProgramCache]: Analyzing trace with hash 844978232, now seen corresponding path program 9 times [2018-11-23 03:46:12,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:12,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:12,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:12,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:12,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:12,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:12,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:46:12,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 03:46:12,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:12,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:12,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:12,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 03:46:12,412 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:12,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:12,412 INFO L82 PathProgramCache]: Analyzing trace with hash 82045398, now seen corresponding path program 9 times [2018-11-23 03:46:12,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:12,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:12,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:12,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:12,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:12,547 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 45 [2018-11-23 03:46:12,554 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:12,554 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:12,554 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:12,554 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:12,554 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:12,554 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:12,554 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:12,554 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:12,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration16_Loop [2018-11-23 03:46:12,554 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:12,554 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:12,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:12,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:12,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:12,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:12,598 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:12,598 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:12,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:12,605 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:12,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:12,630 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:12,633 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:12,651 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:12,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:12,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:12,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:12,651 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:12,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:12,651 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:12,651 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:12,651 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration16_Loop [2018-11-23 03:46:12,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:12,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:12,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:12,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:12,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:12,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:12,708 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:12,708 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:12,709 INFO L122 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 [2018-11-23 03:46:12,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:12,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:12,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:12,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:12,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:12,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:12,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:12,712 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:12,713 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:12,713 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:46:12,714 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:12,714 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:12,714 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:12,714 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:46:12,714 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:12,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:12,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:12,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:12,790 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 [2018-11-23 03:46:12,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 173 transitions. cyclomatic complexity: 39 Second operand 8 states. [2018-11-23 03:46:13,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 173 transitions. cyclomatic complexity: 39. Second operand 8 states. Result 378 states and 460 transitions. Complement of second has 27 states. [2018-11-23 03:46:13,056 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 [2018-11-23 03:46:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 03:46:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2018-11-23 03:46:13,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 38 transitions. Stem has 47 letters. Loop has 44 letters. [2018-11-23 03:46:13,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:13,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 38 transitions. Stem has 91 letters. Loop has 44 letters. [2018-11-23 03:46:13,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:13,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 38 transitions. Stem has 47 letters. Loop has 88 letters. [2018-11-23 03:46:13,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:13,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 460 transitions. [2018-11-23 03:46:13,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2018-11-23 03:46:13,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 289 states and 350 transitions. [2018-11-23 03:46:13,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2018-11-23 03:46:13,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-23 03:46:13,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 350 transitions. [2018-11-23 03:46:13,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:13,064 INFO L705 BuchiCegarLoop]: Abstraction has 289 states and 350 transitions. [2018-11-23 03:46:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 350 transitions. [2018-11-23 03:46:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 197. [2018-11-23 03:46:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-23 03:46:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 242 transitions. [2018-11-23 03:46:13,067 INFO L728 BuchiCegarLoop]: Abstraction has 197 states and 242 transitions. [2018-11-23 03:46:13,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:46:13,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:46:13,068 INFO L87 Difference]: Start difference. First operand 197 states and 242 transitions. Second operand 5 states. [2018-11-23 03:46:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:13,094 INFO L93 Difference]: Finished difference Result 167 states and 201 transitions. [2018-11-23 03:46:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:46:13,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 201 transitions. [2018-11-23 03:46:13,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-11-23 03:46:13,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 159 states and 192 transitions. [2018-11-23 03:46:13,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-23 03:46:13,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-11-23 03:46:13,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 192 transitions. [2018-11-23 03:46:13,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:13,100 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 192 transitions. [2018-11-23 03:46:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 192 transitions. [2018-11-23 03:46:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2018-11-23 03:46:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 03:46:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2018-11-23 03:46:13,103 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 185 transitions. [2018-11-23 03:46:13,103 INFO L608 BuchiCegarLoop]: Abstraction has 152 states and 185 transitions. [2018-11-23 03:46:13,103 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 03:46:13,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 185 transitions. [2018-11-23 03:46:13,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-23 03:46:13,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:13,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:13,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 11, 11, 9, 3, 2, 1, 1] [2018-11-23 03:46:13,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 9, 3, 1, 1] [2018-11-23 03:46:13,105 INFO L794 eck$LassoCheckResult]: Stem: 5246#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; 5247#L18-1 assume !!(main_~i~0 > 0); 5274#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5273#L12-2 assume !(10 == main_~i~0); 5272#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5271#L18-1 assume !!(main_~i~0 > 0); 5270#L12 assume !(1 == main_~i~0); 5269#L12-2 assume !(10 == main_~i~0); 5268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5267#L18-1 assume !!(main_~i~0 > 0); 5264#L12 assume !(1 == main_~i~0); 5266#L12-2 assume !(10 == main_~i~0); 5265#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5263#L18-1 assume !!(main_~i~0 > 0); 5262#L12 assume !(1 == main_~i~0); 5261#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5253#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5254#L18-1 assume !!(main_~i~0 > 0); 5317#L12 assume !(1 == main_~i~0); 5316#L12-2 assume !(10 == main_~i~0); 5315#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5314#L18-1 assume !!(main_~i~0 > 0); 5313#L12 assume !(1 == main_~i~0); 5312#L12-2 assume !(10 == main_~i~0); 5311#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5310#L18-1 assume !!(main_~i~0 > 0); 5309#L12 assume !(1 == main_~i~0); 5308#L12-2 assume !(10 == main_~i~0); 5307#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5306#L18-1 assume !!(main_~i~0 > 0); 5305#L12 assume !(1 == main_~i~0); 5304#L12-2 assume !(10 == main_~i~0); 5303#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5302#L18-1 assume !!(main_~i~0 > 0); 5301#L12 assume !(1 == main_~i~0); 5300#L12-2 assume !(10 == main_~i~0); 5299#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5298#L18-1 assume !!(main_~i~0 > 0); 5297#L12 assume !(1 == main_~i~0); 5296#L12-2 assume !(10 == main_~i~0); 5295#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5294#L18-1 assume !!(main_~i~0 > 0); 5293#L12 assume !(1 == main_~i~0); 5292#L12-2 assume !(10 == main_~i~0); 5291#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5290#L18-1 assume !!(main_~i~0 > 0); 5289#L12 assume !(1 == main_~i~0); 5282#L12-2 assume !(10 == main_~i~0); 5287#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5286#L18-1 assume !!(main_~i~0 > 0); 5280#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5281#L12-2 [2018-11-23 03:46:13,105 INFO L796 eck$LassoCheckResult]: Loop: 5281#L12-2 assume !(10 == main_~i~0); 5390#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5393#L18-1 assume !!(main_~i~0 > 0); 5391#L12 assume !(1 == main_~i~0); 5392#L12-2 assume !(10 == main_~i~0); 5256#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5257#L18-1 assume !!(main_~i~0 > 0); 5285#L12 assume !(1 == main_~i~0); 5259#L12-2 assume !(10 == main_~i~0); 5260#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5387#L18-1 assume !!(main_~i~0 > 0); 5386#L12 assume !(1 == main_~i~0); 5385#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5243#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5258#L18-1 assume !!(main_~i~0 > 0); 5381#L12 assume !(1 == main_~i~0); 5379#L12-2 assume !(10 == main_~i~0); 5377#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5375#L18-1 assume !!(main_~i~0 > 0); 5373#L12 assume !(1 == main_~i~0); 5371#L12-2 assume !(10 == main_~i~0); 5369#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5367#L18-1 assume !!(main_~i~0 > 0); 5365#L12 assume !(1 == main_~i~0); 5363#L12-2 assume !(10 == main_~i~0); 5361#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5359#L18-1 assume !!(main_~i~0 > 0); 5357#L12 assume !(1 == main_~i~0); 5355#L12-2 assume !(10 == main_~i~0); 5353#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5351#L18-1 assume !!(main_~i~0 > 0); 5349#L12 assume !(1 == main_~i~0); 5347#L12-2 assume !(10 == main_~i~0); 5345#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5343#L18-1 assume !!(main_~i~0 > 0); 5341#L12 assume !(1 == main_~i~0); 5339#L12-2 assume !(10 == main_~i~0); 5337#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5335#L18-1 assume !!(main_~i~0 > 0); 5333#L12 assume !(1 == main_~i~0); 5331#L12-2 assume !(10 == main_~i~0); 5329#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5327#L18-1 assume !!(main_~i~0 > 0); 5326#L12 assume !(1 == main_~i~0); 5324#L12-2 assume !(10 == main_~i~0); 5322#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5318#L18-1 assume !!(main_~i~0 > 0); 5319#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5281#L12-2 [2018-11-23 03:46:13,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash -890757087, now seen corresponding path program 10 times [2018-11-23 03:46:13,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:13,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:13,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:13,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:13,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 137 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:13,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:13,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:13,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:46:13,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:46:13,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:13,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 137 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:13,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:13,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 03:46:13,221 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:13,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:13,221 INFO L82 PathProgramCache]: Analyzing trace with hash -294604097, now seen corresponding path program 10 times [2018-11-23 03:46:13,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:13,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:13,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:13,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:13,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:13,354 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2018-11-23 03:46:13,360 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:13,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:13,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:13,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:13,360 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:13,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:13,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:13,360 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:13,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration17_Loop [2018-11-23 03:46:13,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:13,361 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:13,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:13,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:13,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:13,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:13,401 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:13,401 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:13,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:13,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:13,424 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:13,424 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:13,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:13,427 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:13,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:13,448 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:13,480 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:13,481 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:13,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:13,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:13,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:13,482 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:13,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:13,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:13,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:13,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration17_Loop [2018-11-23 03:46:13,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:13,482 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:13,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:13,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:13,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:13,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:13,520 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:13,520 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:13,520 INFO L122 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 [2018-11-23 03:46:13,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:13,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:13,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:13,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:13,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:46:13,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:46:13,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:13,523 INFO L122 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 [2018-11-23 03:46:13,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:13,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:13,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:13,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:13,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:13,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:13,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:13,524 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:13,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:13,525 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:46:13,525 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:13,525 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:13,526 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:13,526 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:46:13,526 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:13,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:13,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:13,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:13,590 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 [2018-11-23 03:46:13,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 185 transitions. cyclomatic complexity: 39 Second operand 7 states. [2018-11-23 03:46:13,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 185 transitions. cyclomatic complexity: 39. Second operand 7 states. Result 486 states and 584 transitions. Complement of second has 19 states. [2018-11-23 03:46:13,696 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 [2018-11-23 03:46:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 03:46:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-11-23 03:46:13,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 51 letters. Loop has 48 letters. [2018-11-23 03:46:13,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:13,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 99 letters. Loop has 48 letters. [2018-11-23 03:46:13,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:13,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 51 letters. Loop has 96 letters. [2018-11-23 03:46:13,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:13,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 486 states and 584 transitions. [2018-11-23 03:46:13,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-23 03:46:13,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 486 states to 419 states and 494 transitions. [2018-11-23 03:46:13,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2018-11-23 03:46:13,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2018-11-23 03:46:13,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 494 transitions. [2018-11-23 03:46:13,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:13,706 INFO L705 BuchiCegarLoop]: Abstraction has 419 states and 494 transitions. [2018-11-23 03:46:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 494 transitions. [2018-11-23 03:46:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 385. [2018-11-23 03:46:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-23 03:46:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 460 transitions. [2018-11-23 03:46:13,718 INFO L728 BuchiCegarLoop]: Abstraction has 385 states and 460 transitions. [2018-11-23 03:46:13,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:46:13,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:46:13,718 INFO L87 Difference]: Start difference. First operand 385 states and 460 transitions. Second operand 6 states. [2018-11-23 03:46:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:13,749 INFO L93 Difference]: Finished difference Result 195 states and 228 transitions. [2018-11-23 03:46:13,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:46:13,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 228 transitions. [2018-11-23 03:46:13,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2018-11-23 03:46:13,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 171 states and 204 transitions. [2018-11-23 03:46:13,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-23 03:46:13,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-23 03:46:13,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 204 transitions. [2018-11-23 03:46:13,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:13,752 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 204 transitions. [2018-11-23 03:46:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 204 transitions. [2018-11-23 03:46:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-11-23 03:46:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 03:46:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 197 transitions. [2018-11-23 03:46:13,755 INFO L728 BuchiCegarLoop]: Abstraction has 164 states and 197 transitions. [2018-11-23 03:46:13,755 INFO L608 BuchiCegarLoop]: Abstraction has 164 states and 197 transitions. [2018-11-23 03:46:13,755 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 03:46:13,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 197 transitions. [2018-11-23 03:46:13,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-23 03:46:13,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:13,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:13,757 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 12, 12, 9, 4, 2, 1, 1] [2018-11-23 03:46:13,757 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] [2018-11-23 03:46:13,757 INFO L794 eck$LassoCheckResult]: Stem: 6962#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; 6963#L18-1 assume !!(main_~i~0 > 0); 6991#L12 assume 1 == main_~i~0;main_~up~0 := 1; 6990#L12-2 assume !(10 == main_~i~0); 6989#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6988#L18-1 assume !!(main_~i~0 > 0); 6987#L12 assume !(1 == main_~i~0); 6986#L12-2 assume !(10 == main_~i~0); 6985#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6984#L18-1 assume !!(main_~i~0 > 0); 6983#L12 assume !(1 == main_~i~0); 6982#L12-2 assume !(10 == main_~i~0); 6981#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6980#L18-1 assume !!(main_~i~0 > 0); 6977#L12 assume !(1 == main_~i~0); 6979#L12-2 assume !(10 == main_~i~0); 6978#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6976#L18-1 assume !!(main_~i~0 > 0); 6975#L12 assume !(1 == main_~i~0); 6974#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 6969#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6970#L18-1 assume !!(main_~i~0 > 0); 7034#L12 assume !(1 == main_~i~0); 7033#L12-2 assume !(10 == main_~i~0); 7032#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7031#L18-1 assume !!(main_~i~0 > 0); 7030#L12 assume !(1 == main_~i~0); 7029#L12-2 assume !(10 == main_~i~0); 7028#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7027#L18-1 assume !!(main_~i~0 > 0); 7026#L12 assume !(1 == main_~i~0); 7025#L12-2 assume !(10 == main_~i~0); 7024#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7023#L18-1 assume !!(main_~i~0 > 0); 7022#L12 assume !(1 == main_~i~0); 7021#L12-2 assume !(10 == main_~i~0); 7020#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7019#L18-1 assume !!(main_~i~0 > 0); 7018#L12 assume !(1 == main_~i~0); 7017#L12-2 assume !(10 == main_~i~0); 7016#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7015#L18-1 assume !!(main_~i~0 > 0); 7014#L12 assume !(1 == main_~i~0); 7013#L12-2 assume !(10 == main_~i~0); 7012#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7011#L18-1 assume !!(main_~i~0 > 0); 7010#L12 assume !(1 == main_~i~0); 7009#L12-2 assume !(10 == main_~i~0); 7008#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7007#L18-1 assume !!(main_~i~0 > 0); 7006#L12 assume !(1 == main_~i~0); 6999#L12-2 assume !(10 == main_~i~0); 7004#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7003#L18-1 assume !!(main_~i~0 > 0); 6997#L12 assume 1 == main_~i~0;main_~up~0 := 1; 6998#L12-2 [2018-11-23 03:46:13,758 INFO L796 eck$LassoCheckResult]: Loop: 6998#L12-2 assume !(10 == main_~i~0); 7121#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7120#L18-1 assume !!(main_~i~0 > 0); 7001#L12 assume !(1 == main_~i~0); 7002#L12-2 assume !(10 == main_~i~0); 7119#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7118#L18-1 assume !!(main_~i~0 > 0); 7117#L12 assume !(1 == main_~i~0); 7116#L12-2 assume !(10 == main_~i~0); 7114#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7112#L18-1 assume !!(main_~i~0 > 0); 7110#L12 assume !(1 == main_~i~0); 7109#L12-2 assume !(10 == main_~i~0); 7104#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7107#L18-1 assume !!(main_~i~0 > 0); 7106#L12 assume !(1 == main_~i~0); 7103#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 6959#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6972#L18-1 assume !!(main_~i~0 > 0); 7099#L12 assume !(1 == main_~i~0); 7097#L12-2 assume !(10 == main_~i~0); 7095#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7093#L18-1 assume !!(main_~i~0 > 0); 7091#L12 assume !(1 == main_~i~0); 7089#L12-2 assume !(10 == main_~i~0); 7087#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7085#L18-1 assume !!(main_~i~0 > 0); 7083#L12 assume !(1 == main_~i~0); 7081#L12-2 assume !(10 == main_~i~0); 7079#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7077#L18-1 assume !!(main_~i~0 > 0); 7075#L12 assume !(1 == main_~i~0); 7073#L12-2 assume !(10 == main_~i~0); 7071#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7069#L18-1 assume !!(main_~i~0 > 0); 7067#L12 assume !(1 == main_~i~0); 7065#L12-2 assume !(10 == main_~i~0); 7063#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7061#L18-1 assume !!(main_~i~0 > 0); 7059#L12 assume !(1 == main_~i~0); 7057#L12-2 assume !(10 == main_~i~0); 7055#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7053#L18-1 assume !!(main_~i~0 > 0); 7051#L12 assume !(1 == main_~i~0); 7049#L12-2 assume !(10 == main_~i~0); 7047#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7045#L18-1 assume !!(main_~i~0 > 0); 7043#L12 assume !(1 == main_~i~0); 7042#L12-2 assume !(10 == main_~i~0); 7040#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7037#L18-1 assume !!(main_~i~0 > 0); 7038#L12 assume 1 == main_~i~0;main_~up~0 := 1; 6998#L12-2 [2018-11-23 03:46:13,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 260754314, now seen corresponding path program 11 times [2018-11-23 03:46:13,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:13,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:13,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:13,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:13,807 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 03:46:13,831 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 03:46:13,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:13,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:13,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:13,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 03:46:13,856 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:13,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1093459752, now seen corresponding path program 11 times [2018-11-23 03:46:13,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:13,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:13,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:13,988 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 51 [2018-11-23 03:46:13,993 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:13,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:13,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:13,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:13,993 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:13,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:13,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:13,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:13,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-23 03:46:13,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:13,993 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:13,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,034 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:14,034 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:14,037 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:14,039 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:14,039 INFO L448 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/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:14,057 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:14,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:14,084 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:14,101 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:14,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:14,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:14,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:14,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:14,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:14,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:14,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-23 03:46:14,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:14,101 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:14,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,138 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:14,138 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:14,138 INFO L122 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 [2018-11-23 03:46:14,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:14,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:14,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:14,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:14,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:46:14,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:46:14,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:14,141 INFO L122 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 [2018-11-23 03:46:14,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:14,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:14,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:14,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:14,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:14,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:14,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:14,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:14,144 INFO L122 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 [2018-11-23 03:46:14,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:14,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:14,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:14,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:14,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:14,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:14,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:14,146 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:14,147 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:14,148 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:46:14,148 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:14,148 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:14,148 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:14,148 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:46:14,149 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:14,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:14,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:14,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:14,254 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 [2018-11-23 03:46:14,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 197 transitions. cyclomatic complexity: 39 Second operand 8 states. [2018-11-23 03:46:14,418 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 197 transitions. cyclomatic complexity: 39. Second operand 8 states. Result 586 states and 700 transitions. Complement of second has 23 states. [2018-11-23 03:46:14,421 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 [2018-11-23 03:46:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 03:46:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-23 03:46:14,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 52 letters. [2018-11-23 03:46:14,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:14,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 107 letters. Loop has 52 letters. [2018-11-23 03:46:14,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:14,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 104 letters. [2018-11-23 03:46:14,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:14,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 586 states and 700 transitions. [2018-11-23 03:46:14,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2018-11-23 03:46:14,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 586 states to 485 states and 570 transitions. [2018-11-23 03:46:14,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2018-11-23 03:46:14,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-23 03:46:14,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 570 transitions. [2018-11-23 03:46:14,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:14,429 INFO L705 BuchiCegarLoop]: Abstraction has 485 states and 570 transitions. [2018-11-23 03:46:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 570 transitions. [2018-11-23 03:46:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 441. [2018-11-23 03:46:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-11-23 03:46:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 526 transitions. [2018-11-23 03:46:14,437 INFO L728 BuchiCegarLoop]: Abstraction has 441 states and 526 transitions. [2018-11-23 03:46:14,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:46:14,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:46:14,438 INFO L87 Difference]: Start difference. First operand 441 states and 526 transitions. Second operand 7 states. [2018-11-23 03:46:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:14,474 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2018-11-23 03:46:14,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:46:14,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 248 transitions. [2018-11-23 03:46:14,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2018-11-23 03:46:14,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 183 states and 216 transitions. [2018-11-23 03:46:14,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-23 03:46:14,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-23 03:46:14,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 216 transitions. [2018-11-23 03:46:14,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:14,477 INFO L705 BuchiCegarLoop]: Abstraction has 183 states and 216 transitions. [2018-11-23 03:46:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 216 transitions. [2018-11-23 03:46:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2018-11-23 03:46:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-23 03:46:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 209 transitions. [2018-11-23 03:46:14,480 INFO L728 BuchiCegarLoop]: Abstraction has 176 states and 209 transitions. [2018-11-23 03:46:14,480 INFO L608 BuchiCegarLoop]: Abstraction has 176 states and 209 transitions. [2018-11-23 03:46:14,480 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 03:46:14,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 209 transitions. [2018-11-23 03:46:14,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2018-11-23 03:46:14,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:14,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:14,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 13, 13, 9, 5, 2, 1, 1] [2018-11-23 03:46:14,482 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 9, 5, 1, 1] [2018-11-23 03:46:14,483 INFO L794 eck$LassoCheckResult]: Stem: 8911#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; 8912#L18-1 assume !!(main_~i~0 > 0); 8944#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8943#L12-2 assume !(10 == main_~i~0); 8942#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8941#L18-1 assume !!(main_~i~0 > 0); 8940#L12 assume !(1 == main_~i~0); 8939#L12-2 assume !(10 == main_~i~0); 8938#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8937#L18-1 assume !!(main_~i~0 > 0); 8936#L12 assume !(1 == main_~i~0); 8935#L12-2 assume !(10 == main_~i~0); 8934#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8933#L18-1 assume !!(main_~i~0 > 0); 8932#L12 assume !(1 == main_~i~0); 8931#L12-2 assume !(10 == main_~i~0); 8930#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8929#L18-1 assume !!(main_~i~0 > 0); 8926#L12 assume !(1 == main_~i~0); 8928#L12-2 assume !(10 == main_~i~0); 8927#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8925#L18-1 assume !!(main_~i~0 > 0); 8924#L12 assume !(1 == main_~i~0); 8923#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 8918#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8919#L18-1 assume !!(main_~i~0 > 0); 8987#L12 assume !(1 == main_~i~0); 8986#L12-2 assume !(10 == main_~i~0); 8985#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8984#L18-1 assume !!(main_~i~0 > 0); 8983#L12 assume !(1 == main_~i~0); 8982#L12-2 assume !(10 == main_~i~0); 8981#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8980#L18-1 assume !!(main_~i~0 > 0); 8979#L12 assume !(1 == main_~i~0); 8978#L12-2 assume !(10 == main_~i~0); 8977#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8976#L18-1 assume !!(main_~i~0 > 0); 8975#L12 assume !(1 == main_~i~0); 8974#L12-2 assume !(10 == main_~i~0); 8973#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8972#L18-1 assume !!(main_~i~0 > 0); 8971#L12 assume !(1 == main_~i~0); 8970#L12-2 assume !(10 == main_~i~0); 8969#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8968#L18-1 assume !!(main_~i~0 > 0); 8967#L12 assume !(1 == main_~i~0); 8966#L12-2 assume !(10 == main_~i~0); 8965#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8964#L18-1 assume !!(main_~i~0 > 0); 8963#L12 assume !(1 == main_~i~0); 8962#L12-2 assume !(10 == main_~i~0); 8961#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8960#L18-1 assume !!(main_~i~0 > 0); 8959#L12 assume !(1 == main_~i~0); 8953#L12-2 assume !(10 == main_~i~0); 8957#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8956#L18-1 assume !!(main_~i~0 > 0); 8951#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8952#L12-2 [2018-11-23 03:46:14,483 INFO L796 eck$LassoCheckResult]: Loop: 8952#L12-2 assume !(10 == main_~i~0); 9082#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9080#L18-1 assume !!(main_~i~0 > 0); 8954#L12 assume !(1 == main_~i~0); 8955#L12-2 assume !(10 == main_~i~0); 9081#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9079#L18-1 assume !!(main_~i~0 > 0); 9078#L12 assume !(1 == main_~i~0); 9077#L12-2 assume !(10 == main_~i~0); 9076#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9074#L18-1 assume !!(main_~i~0 > 0); 9072#L12 assume !(1 == main_~i~0); 9070#L12-2 assume !(10 == main_~i~0); 9068#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9066#L18-1 assume !!(main_~i~0 > 0); 9064#L12 assume !(1 == main_~i~0); 9062#L12-2 assume !(10 == main_~i~0); 9057#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9060#L18-1 assume !!(main_~i~0 > 0); 9059#L12 assume !(1 == main_~i~0); 9056#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 8908#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8921#L18-1 assume !!(main_~i~0 > 0); 9052#L12 assume !(1 == main_~i~0); 9050#L12-2 assume !(10 == main_~i~0); 9048#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9046#L18-1 assume !!(main_~i~0 > 0); 9044#L12 assume !(1 == main_~i~0); 9042#L12-2 assume !(10 == main_~i~0); 9040#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9038#L18-1 assume !!(main_~i~0 > 0); 9036#L12 assume !(1 == main_~i~0); 9034#L12-2 assume !(10 == main_~i~0); 9032#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9030#L18-1 assume !!(main_~i~0 > 0); 9028#L12 assume !(1 == main_~i~0); 9026#L12-2 assume !(10 == main_~i~0); 9024#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9022#L18-1 assume !!(main_~i~0 > 0); 9020#L12 assume !(1 == main_~i~0); 9018#L12-2 assume !(10 == main_~i~0); 9016#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9014#L18-1 assume !!(main_~i~0 > 0); 9012#L12 assume !(1 == main_~i~0); 9010#L12-2 assume !(10 == main_~i~0); 9008#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9006#L18-1 assume !!(main_~i~0 > 0); 9004#L12 assume !(1 == main_~i~0); 9002#L12-2 assume !(10 == main_~i~0); 9000#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8998#L18-1 assume !!(main_~i~0 > 0); 8996#L12 assume !(1 == main_~i~0); 8995#L12-2 assume !(10 == main_~i~0); 8993#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8990#L18-1 assume !!(main_~i~0 > 0); 8991#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8952#L12-2 [2018-11-23 03:46:14,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1566074253, now seen corresponding path program 12 times [2018-11-23 03:46:14,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:14,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:14,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 211 proven. 45 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:14,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:14,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:14,537 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 03:46:14,559 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-23 03:46:14,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:14,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 211 proven. 45 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:14,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:14,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 03:46:14,584 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:14,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1203416849, now seen corresponding path program 12 times [2018-11-23 03:46:14,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:14,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:14,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:14,736 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 54 [2018-11-23 03:46:14,741 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:14,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:14,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:14,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:14,742 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:14,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:14,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:14,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-23 03:46:14,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:14,742 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:14,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,784 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:14,784 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:14,786 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:14,805 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:14,805 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:14,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:14,811 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:14,811 INFO L448 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/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:14,829 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:14,849 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:14,851 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:14,866 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:14,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:14,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:14,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:14,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:14,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:14,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:14,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:14,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-23 03:46:14,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:14,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:14,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:14,901 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:14,901 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:14,901 INFO L122 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 [2018-11-23 03:46:14,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:14,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:14,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:14,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:14,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:46:14,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:46:14,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:14,904 INFO L122 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 [2018-11-23 03:46:14,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:14,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:14,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:14,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:14,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:14,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:14,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:14,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:14,907 INFO L122 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 [2018-11-23 03:46:14,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:14,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:14,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:14,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:14,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:14,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:14,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:14,909 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:14,910 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:14,910 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:46:14,911 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:14,911 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:14,911 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:14,911 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:46:14,911 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:14,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:14,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:14,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:14,999 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 [2018-11-23 03:46:14,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 209 transitions. cyclomatic complexity: 39 Second operand 9 states. [2018-11-23 03:46:15,173 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 209 transitions. cyclomatic complexity: 39. Second operand 9 states. Result 702 states and 836 transitions. Complement of second has 27 states. [2018-11-23 03:46:15,174 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 [2018-11-23 03:46:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 03:46:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-11-23 03:46:15,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 59 letters. Loop has 56 letters. [2018-11-23 03:46:15,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:15,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 115 letters. Loop has 56 letters. [2018-11-23 03:46:15,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:15,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 59 letters. Loop has 112 letters. [2018-11-23 03:46:15,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:15,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 702 states and 836 transitions. [2018-11-23 03:46:15,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2018-11-23 03:46:15,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 702 states to 559 states and 656 transitions. [2018-11-23 03:46:15,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2018-11-23 03:46:15,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2018-11-23 03:46:15,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 559 states and 656 transitions. [2018-11-23 03:46:15,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:15,181 INFO L705 BuchiCegarLoop]: Abstraction has 559 states and 656 transitions. [2018-11-23 03:46:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states and 656 transitions. [2018-11-23 03:46:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 505. [2018-11-23 03:46:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-11-23 03:46:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 602 transitions. [2018-11-23 03:46:15,189 INFO L728 BuchiCegarLoop]: Abstraction has 505 states and 602 transitions. [2018-11-23 03:46:15,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:46:15,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:46:15,189 INFO L87 Difference]: Start difference. First operand 505 states and 602 transitions. Second operand 8 states. [2018-11-23 03:46:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:15,231 INFO L93 Difference]: Finished difference Result 235 states and 268 transitions. [2018-11-23 03:46:15,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:46:15,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 268 transitions. [2018-11-23 03:46:15,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-23 03:46:15,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 195 states and 228 transitions. [2018-11-23 03:46:15,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-11-23 03:46:15,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-23 03:46:15,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 228 transitions. [2018-11-23 03:46:15,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:15,233 INFO L705 BuchiCegarLoop]: Abstraction has 195 states and 228 transitions. [2018-11-23 03:46:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 228 transitions. [2018-11-23 03:46:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 188. [2018-11-23 03:46:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-23 03:46:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 221 transitions. [2018-11-23 03:46:15,235 INFO L728 BuchiCegarLoop]: Abstraction has 188 states and 221 transitions. [2018-11-23 03:46:15,235 INFO L608 BuchiCegarLoop]: Abstraction has 188 states and 221 transitions. [2018-11-23 03:46:15,235 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 03:46:15,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 221 transitions. [2018-11-23 03:46:15,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2018-11-23 03:46:15,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:15,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:15,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 2, 1, 1] [2018-11-23 03:46:15,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2018-11-23 03:46:15,236 INFO L794 eck$LassoCheckResult]: Stem: 11117#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; 11118#L18-1 assume !!(main_~i~0 > 0); 11154#L12 assume 1 == main_~i~0;main_~up~0 := 1; 11153#L12-2 assume !(10 == main_~i~0); 11152#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11151#L18-1 assume !!(main_~i~0 > 0); 11150#L12 assume !(1 == main_~i~0); 11149#L12-2 assume !(10 == main_~i~0); 11148#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11147#L18-1 assume !!(main_~i~0 > 0); 11146#L12 assume !(1 == main_~i~0); 11145#L12-2 assume !(10 == main_~i~0); 11144#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11143#L18-1 assume !!(main_~i~0 > 0); 11142#L12 assume !(1 == main_~i~0); 11141#L12-2 assume !(10 == main_~i~0); 11140#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11139#L18-1 assume !!(main_~i~0 > 0); 11138#L12 assume !(1 == main_~i~0); 11137#L12-2 assume !(10 == main_~i~0); 11136#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11135#L18-1 assume !!(main_~i~0 > 0); 11132#L12 assume !(1 == main_~i~0); 11134#L12-2 assume !(10 == main_~i~0); 11133#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11131#L18-1 assume !!(main_~i~0 > 0); 11130#L12 assume !(1 == main_~i~0); 11129#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 11124#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11125#L18-1 assume !!(main_~i~0 > 0); 11197#L12 assume !(1 == main_~i~0); 11196#L12-2 assume !(10 == main_~i~0); 11195#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11194#L18-1 assume !!(main_~i~0 > 0); 11193#L12 assume !(1 == main_~i~0); 11192#L12-2 assume !(10 == main_~i~0); 11191#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11190#L18-1 assume !!(main_~i~0 > 0); 11189#L12 assume !(1 == main_~i~0); 11188#L12-2 assume !(10 == main_~i~0); 11187#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11186#L18-1 assume !!(main_~i~0 > 0); 11185#L12 assume !(1 == main_~i~0); 11184#L12-2 assume !(10 == main_~i~0); 11183#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11182#L18-1 assume !!(main_~i~0 > 0); 11181#L12 assume !(1 == main_~i~0); 11180#L12-2 assume !(10 == main_~i~0); 11179#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11178#L18-1 assume !!(main_~i~0 > 0); 11177#L12 assume !(1 == main_~i~0); 11176#L12-2 assume !(10 == main_~i~0); 11175#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11174#L18-1 assume !!(main_~i~0 > 0); 11173#L12 assume !(1 == main_~i~0); 11172#L12-2 assume !(10 == main_~i~0); 11171#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11170#L18-1 assume !!(main_~i~0 > 0); 11169#L12 assume !(1 == main_~i~0); 11163#L12-2 assume !(10 == main_~i~0); 11167#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11166#L18-1 assume !!(main_~i~0 > 0); 11161#L12 assume 1 == main_~i~0;main_~up~0 := 1; 11162#L12-2 [2018-11-23 03:46:15,236 INFO L796 eck$LassoCheckResult]: Loop: 11162#L12-2 assume !(10 == main_~i~0); 11300#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11298#L18-1 assume !!(main_~i~0 > 0); 11164#L12 assume !(1 == main_~i~0); 11165#L12-2 assume !(10 == main_~i~0); 11299#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11297#L18-1 assume !!(main_~i~0 > 0); 11296#L12 assume !(1 == main_~i~0); 11295#L12-2 assume !(10 == main_~i~0); 11294#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11292#L18-1 assume !!(main_~i~0 > 0); 11290#L12 assume !(1 == main_~i~0); 11288#L12-2 assume !(10 == main_~i~0); 11286#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11284#L18-1 assume !!(main_~i~0 > 0); 11282#L12 assume !(1 == main_~i~0); 11280#L12-2 assume !(10 == main_~i~0); 11278#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11276#L18-1 assume !!(main_~i~0 > 0); 11274#L12 assume !(1 == main_~i~0); 11272#L12-2 assume !(10 == main_~i~0); 11267#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11270#L18-1 assume !!(main_~i~0 > 0); 11269#L12 assume !(1 == main_~i~0); 11266#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 11114#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11127#L18-1 assume !!(main_~i~0 > 0); 11262#L12 assume !(1 == main_~i~0); 11260#L12-2 assume !(10 == main_~i~0); 11258#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11256#L18-1 assume !!(main_~i~0 > 0); 11254#L12 assume !(1 == main_~i~0); 11252#L12-2 assume !(10 == main_~i~0); 11250#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11248#L18-1 assume !!(main_~i~0 > 0); 11246#L12 assume !(1 == main_~i~0); 11244#L12-2 assume !(10 == main_~i~0); 11242#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11240#L18-1 assume !!(main_~i~0 > 0); 11238#L12 assume !(1 == main_~i~0); 11236#L12-2 assume !(10 == main_~i~0); 11234#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11232#L18-1 assume !!(main_~i~0 > 0); 11230#L12 assume !(1 == main_~i~0); 11228#L12-2 assume !(10 == main_~i~0); 11226#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11224#L18-1 assume !!(main_~i~0 > 0); 11222#L12 assume !(1 == main_~i~0); 11220#L12-2 assume !(10 == main_~i~0); 11218#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11216#L18-1 assume !!(main_~i~0 > 0); 11214#L12 assume !(1 == main_~i~0); 11212#L12-2 assume !(10 == main_~i~0); 11210#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11208#L18-1 assume !!(main_~i~0 > 0); 11206#L12 assume !(1 == main_~i~0); 11205#L12-2 assume !(10 == main_~i~0); 11203#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11200#L18-1 assume !!(main_~i~0 > 0); 11201#L12 assume 1 == main_~i~0;main_~up~0 := 1; 11162#L12-2 [2018-11-23 03:46:15,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:15,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1417622308, now seen corresponding path program 13 times [2018-11-23 03:46:15,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:15,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:15,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:15,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:15,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 248 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:15,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:15,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:15,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:15,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 248 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:15,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:15,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 03:46:15,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:15,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1315151238, now seen corresponding path program 13 times [2018-11-23 03:46:15,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:15,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:15,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:15,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:15,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:15,520 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 57 [2018-11-23 03:46:15,524 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:15,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:15,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:15,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:15,524 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:15,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:15,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:15,525 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:15,525 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-23 03:46:15,525 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:15,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:15,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:15,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:15,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:15,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:15,559 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:15,560 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:15,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:15,561 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:15,580 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:15,580 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_18=1} Honda state: {v_rep~unnamed0~0~true_18=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:15,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:15,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:15,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:15,585 INFO L448 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/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:15,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:15,611 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:15,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:15,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:15,635 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:15,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:15,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:15,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:15,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:15,652 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:15,652 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:15,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:15,652 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:15,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-23 03:46:15,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:15,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:15,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:15,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:15,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:15,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:15,690 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:15,690 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:15,691 INFO L122 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 [2018-11-23 03:46:15,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:15,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:15,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:15,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:15,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:15,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:15,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:15,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:15,693 INFO L122 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 [2018-11-23 03:46:15,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:15,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:15,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:15,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:15,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:15,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:15,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:15,696 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:15,696 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:15,697 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:46:15,697 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:15,697 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:15,697 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:15,697 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:46:15,698 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:15,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:15,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:15,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:15,796 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 [2018-11-23 03:46:15,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 221 transitions. cyclomatic complexity: 39 Second operand 10 states. [2018-11-23 03:46:16,044 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 221 transitions. cyclomatic complexity: 39. Second operand 10 states. Result 834 states and 992 transitions. Complement of second has 31 states. [2018-11-23 03:46:16,044 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 [2018-11-23 03:46:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 03:46:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2018-11-23 03:46:16,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 63 letters. Loop has 60 letters. [2018-11-23 03:46:16,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:16,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 123 letters. Loop has 60 letters. [2018-11-23 03:46:16,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:16,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 63 letters. Loop has 120 letters. [2018-11-23 03:46:16,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:16,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 834 states and 992 transitions. [2018-11-23 03:46:16,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2018-11-23 03:46:16,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 834 states to 641 states and 752 transitions. [2018-11-23 03:46:16,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-23 03:46:16,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-11-23 03:46:16,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 641 states and 752 transitions. [2018-11-23 03:46:16,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:16,054 INFO L705 BuchiCegarLoop]: Abstraction has 641 states and 752 transitions. [2018-11-23 03:46:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states and 752 transitions. [2018-11-23 03:46:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 577. [2018-11-23 03:46:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-11-23 03:46:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 688 transitions. [2018-11-23 03:46:16,063 INFO L728 BuchiCegarLoop]: Abstraction has 577 states and 688 transitions. [2018-11-23 03:46:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 03:46:16,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:46:16,063 INFO L87 Difference]: Start difference. First operand 577 states and 688 transitions. Second operand 9 states. [2018-11-23 03:46:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:16,123 INFO L93 Difference]: Finished difference Result 255 states and 288 transitions. [2018-11-23 03:46:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:46:16,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 288 transitions. [2018-11-23 03:46:16,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-11-23 03:46:16,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 207 states and 240 transitions. [2018-11-23 03:46:16,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-23 03:46:16,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2018-11-23 03:46:16,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 240 transitions. [2018-11-23 03:46:16,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:16,127 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 240 transitions. [2018-11-23 03:46:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 240 transitions. [2018-11-23 03:46:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2018-11-23 03:46:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 03:46:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2018-11-23 03:46:16,138 INFO L728 BuchiCegarLoop]: Abstraction has 200 states and 233 transitions. [2018-11-23 03:46:16,138 INFO L608 BuchiCegarLoop]: Abstraction has 200 states and 233 transitions. [2018-11-23 03:46:16,138 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 03:46:16,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 233 transitions. [2018-11-23 03:46:16,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2018-11-23 03:46:16,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:16,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:16,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 15, 9, 7, 2, 1, 1] [2018-11-23 03:46:16,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 9, 7, 1, 1] [2018-11-23 03:46:16,147 INFO L794 eck$LassoCheckResult]: Stem: 13604#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; 13605#L18-1 assume !!(main_~i~0 > 0); 13645#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13644#L12-2 assume !(10 == main_~i~0); 13643#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13642#L18-1 assume !!(main_~i~0 > 0); 13641#L12 assume !(1 == main_~i~0); 13640#L12-2 assume !(10 == main_~i~0); 13639#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13638#L18-1 assume !!(main_~i~0 > 0); 13637#L12 assume !(1 == main_~i~0); 13636#L12-2 assume !(10 == main_~i~0); 13635#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13634#L18-1 assume !!(main_~i~0 > 0); 13633#L12 assume !(1 == main_~i~0); 13632#L12-2 assume !(10 == main_~i~0); 13631#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13630#L18-1 assume !!(main_~i~0 > 0); 13629#L12 assume !(1 == main_~i~0); 13628#L12-2 assume !(10 == main_~i~0); 13627#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13626#L18-1 assume !!(main_~i~0 > 0); 13625#L12 assume !(1 == main_~i~0); 13624#L12-2 assume !(10 == main_~i~0); 13623#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13622#L18-1 assume !!(main_~i~0 > 0); 13619#L12 assume !(1 == main_~i~0); 13621#L12-2 assume !(10 == main_~i~0); 13620#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13618#L18-1 assume !!(main_~i~0 > 0); 13617#L12 assume !(1 == main_~i~0); 13616#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 13612#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13613#L18-1 assume !!(main_~i~0 > 0); 13783#L12 assume !(1 == main_~i~0); 13782#L12-2 assume !(10 == main_~i~0); 13781#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13779#L18-1 assume !!(main_~i~0 > 0); 13771#L12 assume !(1 == main_~i~0); 13768#L12-2 assume !(10 == main_~i~0); 13765#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13762#L18-1 assume !!(main_~i~0 > 0); 13759#L12 assume !(1 == main_~i~0); 13756#L12-2 assume !(10 == main_~i~0); 13753#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13750#L18-1 assume !!(main_~i~0 > 0); 13747#L12 assume !(1 == main_~i~0); 13744#L12-2 assume !(10 == main_~i~0); 13741#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13738#L18-1 assume !!(main_~i~0 > 0); 13735#L12 assume !(1 == main_~i~0); 13732#L12-2 assume !(10 == main_~i~0); 13729#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13726#L18-1 assume !!(main_~i~0 > 0); 13723#L12 assume !(1 == main_~i~0); 13720#L12-2 assume !(10 == main_~i~0); 13717#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13714#L18-1 assume !!(main_~i~0 > 0); 13711#L12 assume !(1 == main_~i~0); 13708#L12-2 assume !(10 == main_~i~0); 13705#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13702#L18-1 assume !!(main_~i~0 > 0); 13700#L12 assume !(1 == main_~i~0); 13687#L12-2 assume !(10 == main_~i~0); 13695#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13691#L18-1 assume !!(main_~i~0 > 0); 13686#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13651#L12-2 [2018-11-23 03:46:16,148 INFO L796 eck$LassoCheckResult]: Loop: 13651#L12-2 assume !(10 == main_~i~0); 13652#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13684#L18-1 assume !!(main_~i~0 > 0); 13683#L12 assume !(1 == main_~i~0); 13682#L12-2 assume !(10 == main_~i~0); 13681#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13680#L18-1 assume !!(main_~i~0 > 0); 13679#L12 assume !(1 == main_~i~0); 13678#L12-2 assume !(10 == main_~i~0); 13677#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13676#L18-1 assume !!(main_~i~0 > 0); 13675#L12 assume !(1 == main_~i~0); 13674#L12-2 assume !(10 == main_~i~0); 13673#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13672#L18-1 assume !!(main_~i~0 > 0); 13671#L12 assume !(1 == main_~i~0); 13670#L12-2 assume !(10 == main_~i~0); 13669#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13668#L18-1 assume !!(main_~i~0 > 0); 13667#L12 assume !(1 == main_~i~0); 13666#L12-2 assume !(10 == main_~i~0); 13665#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13664#L18-1 assume !!(main_~i~0 > 0); 13663#L12 assume !(1 == main_~i~0); 13662#L12-2 assume !(10 == main_~i~0); 13654#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13658#L18-1 assume !!(main_~i~0 > 0); 13656#L12 assume !(1 == main_~i~0); 13653#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 13601#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13615#L18-1 assume !!(main_~i~0 > 0); 13610#L12 assume !(1 == main_~i~0); 13611#L12-2 assume !(10 == main_~i~0); 13655#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13774#L18-1 assume !!(main_~i~0 > 0); 13772#L12 assume !(1 == main_~i~0); 13769#L12-2 assume !(10 == main_~i~0); 13766#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13763#L18-1 assume !!(main_~i~0 > 0); 13760#L12 assume !(1 == main_~i~0); 13757#L12-2 assume !(10 == main_~i~0); 13754#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13751#L18-1 assume !!(main_~i~0 > 0); 13748#L12 assume !(1 == main_~i~0); 13745#L12-2 assume !(10 == main_~i~0); 13742#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13739#L18-1 assume !!(main_~i~0 > 0); 13736#L12 assume !(1 == main_~i~0); 13733#L12-2 assume !(10 == main_~i~0); 13730#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13727#L18-1 assume !!(main_~i~0 > 0); 13724#L12 assume !(1 == main_~i~0); 13721#L12-2 assume !(10 == main_~i~0); 13718#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13715#L18-1 assume !!(main_~i~0 > 0); 13712#L12 assume !(1 == main_~i~0); 13709#L12-2 assume !(10 == main_~i~0); 13706#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13703#L18-1 assume !!(main_~i~0 > 0); 13701#L12 assume !(1 == main_~i~0); 13689#L12-2 assume !(10 == main_~i~0); 13696#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13692#L18-1 assume !!(main_~i~0 > 0); 13688#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13651#L12-2 [2018-11-23 03:46:16,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1714987717, now seen corresponding path program 14 times [2018-11-23 03:46:16,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:16,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:16,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:16,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:46:16,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 285 proven. 91 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:16,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:16,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:16,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:46:16,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:46:16,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:16,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 285 proven. 91 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:16,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:16,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 03:46:16,345 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:16,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash 590625123, now seen corresponding path program 14 times [2018-11-23 03:46:16,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:16,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:16,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:16,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:16,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:16,597 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 60 [2018-11-23 03:46:16,602 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:16,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:16,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:16,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:16,603 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:16,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:16,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:16,603 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:16,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-23 03:46:16,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:16,603 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:16,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:16,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:16,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:16,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:16,642 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:16,642 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:16,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:16,644 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:16,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:46:16,662 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_20=0} Honda state: {v_rep~unnamed0~0~false_20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:16,666 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:16,666 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:16,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:16,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:16,689 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:16,706 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:16,706 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:16,706 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:16,706 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:16,706 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:16,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:16,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:16,706 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:16,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-23 03:46:16,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:16,706 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:16,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:16,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:16,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:16,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:16,750 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:16,750 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:16,750 INFO L122 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 [2018-11-23 03:46:16,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:16,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:16,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:16,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:16,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:46:16,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:46:16,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:46:16,752 INFO L122 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 [2018-11-23 03:46:16,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:16,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:16,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:16,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:16,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:16,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:16,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:16,754 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:16,754 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:16,755 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:46:16,755 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:16,755 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:16,755 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:16,755 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:46:16,755 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:16,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:16,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:16,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 344 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:16,848 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 [2018-11-23 03:46:16,848 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 233 transitions. cyclomatic complexity: 39 Second operand 11 states. [2018-11-23 03:46:17,131 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 233 transitions. cyclomatic complexity: 39. Second operand 11 states. Result 982 states and 1168 transitions. Complement of second has 35 states. [2018-11-23 03:46:17,131 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 [2018-11-23 03:46:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 03:46:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2018-11-23 03:46:17,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 67 letters. Loop has 64 letters. [2018-11-23 03:46:17,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:17,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 131 letters. Loop has 64 letters. [2018-11-23 03:46:17,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:17,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 67 letters. Loop has 128 letters. [2018-11-23 03:46:17,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:17,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 982 states and 1168 transitions. [2018-11-23 03:46:17,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68 [2018-11-23 03:46:17,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 982 states to 731 states and 858 transitions. [2018-11-23 03:46:17,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2018-11-23 03:46:17,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2018-11-23 03:46:17,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 731 states and 858 transitions. [2018-11-23 03:46:17,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:17,137 INFO L705 BuchiCegarLoop]: Abstraction has 731 states and 858 transitions. [2018-11-23 03:46:17,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states and 858 transitions. [2018-11-23 03:46:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 657. [2018-11-23 03:46:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-23 03:46:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 784 transitions. [2018-11-23 03:46:17,142 INFO L728 BuchiCegarLoop]: Abstraction has 657 states and 784 transitions. [2018-11-23 03:46:17,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:46:17,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:46:17,142 INFO L87 Difference]: Start difference. First operand 657 states and 784 transitions. Second operand 10 states. [2018-11-23 03:46:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:17,185 INFO L93 Difference]: Finished difference Result 275 states and 308 transitions. [2018-11-23 03:46:17,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 03:46:17,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 308 transitions. [2018-11-23 03:46:17,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-23 03:46:17,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 219 states and 252 transitions. [2018-11-23 03:46:17,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-23 03:46:17,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-11-23 03:46:17,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 252 transitions. [2018-11-23 03:46:17,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:17,189 INFO L705 BuchiCegarLoop]: Abstraction has 219 states and 252 transitions. [2018-11-23 03:46:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 252 transitions. [2018-11-23 03:46:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2018-11-23 03:46:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-23 03:46:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 245 transitions. [2018-11-23 03:46:17,192 INFO L728 BuchiCegarLoop]: Abstraction has 212 states and 245 transitions. [2018-11-23 03:46:17,192 INFO L608 BuchiCegarLoop]: Abstraction has 212 states and 245 transitions. [2018-11-23 03:46:17,192 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 03:46:17,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 245 transitions. [2018-11-23 03:46:17,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2018-11-23 03:46:17,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:17,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:17,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 16, 16, 9, 8, 2, 1, 1] [2018-11-23 03:46:17,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 9, 8, 1, 1] [2018-11-23 03:46:17,194 INFO L794 eck$LassoCheckResult]: Stem: 16396#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; 16397#L18-1 assume !!(main_~i~0 > 0); 16442#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16441#L12-2 assume !(10 == main_~i~0); 16440#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16439#L18-1 assume !!(main_~i~0 > 0); 16438#L12 assume !(1 == main_~i~0); 16437#L12-2 assume !(10 == main_~i~0); 16436#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16435#L18-1 assume !!(main_~i~0 > 0); 16434#L12 assume !(1 == main_~i~0); 16433#L12-2 assume !(10 == main_~i~0); 16432#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16431#L18-1 assume !!(main_~i~0 > 0); 16430#L12 assume !(1 == main_~i~0); 16429#L12-2 assume !(10 == main_~i~0); 16428#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16427#L18-1 assume !!(main_~i~0 > 0); 16426#L12 assume !(1 == main_~i~0); 16425#L12-2 assume !(10 == main_~i~0); 16424#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16423#L18-1 assume !!(main_~i~0 > 0); 16422#L12 assume !(1 == main_~i~0); 16421#L12-2 assume !(10 == main_~i~0); 16420#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16419#L18-1 assume !!(main_~i~0 > 0); 16418#L12 assume !(1 == main_~i~0); 16417#L12-2 assume !(10 == main_~i~0); 16416#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16415#L18-1 assume !!(main_~i~0 > 0); 16412#L12 assume !(1 == main_~i~0); 16414#L12-2 assume !(10 == main_~i~0); 16413#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16411#L18-1 assume !!(main_~i~0 > 0); 16410#L12 assume !(1 == main_~i~0); 16409#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 16404#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16405#L18-1 assume !!(main_~i~0 > 0); 16579#L12 assume !(1 == main_~i~0); 16578#L12-2 assume !(10 == main_~i~0); 16577#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16576#L18-1 assume !!(main_~i~0 > 0); 16574#L12 assume !(1 == main_~i~0); 16571#L12-2 assume !(10 == main_~i~0); 16568#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16565#L18-1 assume !!(main_~i~0 > 0); 16562#L12 assume !(1 == main_~i~0); 16559#L12-2 assume !(10 == main_~i~0); 16556#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16553#L18-1 assume !!(main_~i~0 > 0); 16550#L12 assume !(1 == main_~i~0); 16547#L12-2 assume !(10 == main_~i~0); 16544#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16541#L18-1 assume !!(main_~i~0 > 0); 16538#L12 assume !(1 == main_~i~0); 16535#L12-2 assume !(10 == main_~i~0); 16532#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16529#L18-1 assume !!(main_~i~0 > 0); 16526#L12 assume !(1 == main_~i~0); 16523#L12-2 assume !(10 == main_~i~0); 16520#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16517#L18-1 assume !!(main_~i~0 > 0); 16514#L12 assume !(1 == main_~i~0); 16511#L12-2 assume !(10 == main_~i~0); 16508#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16505#L18-1 assume !!(main_~i~0 > 0); 16502#L12 assume !(1 == main_~i~0); 16491#L12-2 assume !(10 == main_~i~0); 16498#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16495#L18-1 assume !!(main_~i~0 > 0); 16490#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16392#L12-2 [2018-11-23 03:46:17,194 INFO L796 eck$LassoCheckResult]: Loop: 16392#L12-2 assume !(10 == main_~i~0); 16393#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16485#L18-1 assume !!(main_~i~0 > 0); 16484#L12 assume !(1 == main_~i~0); 16483#L12-2 assume !(10 == main_~i~0); 16482#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16481#L18-1 assume !!(main_~i~0 > 0); 16480#L12 assume !(1 == main_~i~0); 16479#L12-2 assume !(10 == main_~i~0); 16478#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16477#L18-1 assume !!(main_~i~0 > 0); 16476#L12 assume !(1 == main_~i~0); 16475#L12-2 assume !(10 == main_~i~0); 16474#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16473#L18-1 assume !!(main_~i~0 > 0); 16472#L12 assume !(1 == main_~i~0); 16471#L12-2 assume !(10 == main_~i~0); 16470#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16469#L18-1 assume !!(main_~i~0 > 0); 16468#L12 assume !(1 == main_~i~0); 16467#L12-2 assume !(10 == main_~i~0); 16466#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16465#L18-1 assume !!(main_~i~0 > 0); 16464#L12 assume !(1 == main_~i~0); 16463#L12-2 assume !(10 == main_~i~0); 16462#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16461#L18-1 assume !!(main_~i~0 > 0); 16460#L12 assume !(1 == main_~i~0); 16459#L12-2 assume !(10 == main_~i~0); 16451#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16456#L18-1 assume !!(main_~i~0 > 0); 16453#L12 assume !(1 == main_~i~0); 16450#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 16407#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16408#L18-1 assume !!(main_~i~0 > 0); 16402#L12 assume !(1 == main_~i~0); 16403#L12-2 assume !(10 == main_~i~0); 16449#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16575#L18-1 assume !!(main_~i~0 > 0); 16573#L12 assume !(1 == main_~i~0); 16570#L12-2 assume !(10 == main_~i~0); 16567#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16564#L18-1 assume !!(main_~i~0 > 0); 16561#L12 assume !(1 == main_~i~0); 16558#L12-2 assume !(10 == main_~i~0); 16555#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16552#L18-1 assume !!(main_~i~0 > 0); 16549#L12 assume !(1 == main_~i~0); 16546#L12-2 assume !(10 == main_~i~0); 16543#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16540#L18-1 assume !!(main_~i~0 > 0); 16537#L12 assume !(1 == main_~i~0); 16534#L12-2 assume !(10 == main_~i~0); 16531#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16528#L18-1 assume !!(main_~i~0 > 0); 16525#L12 assume !(1 == main_~i~0); 16522#L12-2 assume !(10 == main_~i~0); 16519#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16516#L18-1 assume !!(main_~i~0 > 0); 16513#L12 assume !(1 == main_~i~0); 16510#L12-2 assume !(10 == main_~i~0); 16507#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16504#L18-1 assume !!(main_~i~0 > 0); 16501#L12 assume !(1 == main_~i~0); 16489#L12-2 assume !(10 == main_~i~0); 16497#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16494#L18-1 assume !!(main_~i~0 > 0); 16488#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16392#L12-2 [2018-11-23 03:46:17,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1278125010, now seen corresponding path program 15 times [2018-11-23 03:46:17,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:17,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:17,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:17,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 322 proven. 120 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:17,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:46:17,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:46:17,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:46:17,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 03:46:17,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:46:17,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 322 proven. 226 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 03:46:17,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:46:17,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 03:46:17,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:46:17,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:17,359 INFO L82 PathProgramCache]: Analyzing trace with hash -976981044, now seen corresponding path program 15 times [2018-11-23 03:46:17,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:17,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:17,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:17,625 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 63 [2018-11-23 03:46:17,631 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:17,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:17,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:17,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:17,631 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:46:17,631 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:17,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:17,631 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:17,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-23 03:46:17,631 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:17,631 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:17,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:17,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:17,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:17,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:17,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:17,672 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:17,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:46:17,674 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/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 [2018-11-23 03:46:17,694 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:46:17,694 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:46:17,750 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:46:17,751 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:46:17,751 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:46:17,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:46:17,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:46:17,752 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:46:17,752 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:46:17,752 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:46:17,752 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:46:17,752 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex08_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-23 03:46:17,752 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:46:17,752 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:46:17,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:17,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:17,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:17,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:46:17,790 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:46:17,790 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:46:17,791 INFO L122 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 [2018-11-23 03:46:17,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:46:17,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:46:17,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:46:17,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:46:17,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:46:17,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:46:17,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:46:17,793 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:46:17,793 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:46:17,793 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:46:17,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:46:17,794 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:46:17,794 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:46:17,794 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:46:17,794 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:46:17,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:17,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:46:17,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:46:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 03:46:17,897 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 [2018-11-23 03:46:17,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 212 states and 245 transitions. cyclomatic complexity: 39 Second operand 12 states. [2018-11-23 03:46:18,185 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 212 states and 245 transitions. cyclomatic complexity: 39. Second operand 12 states. Result 1146 states and 1366 transitions. Complement of second has 39 states. [2018-11-23 03:46:18,187 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 [2018-11-23 03:46:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 03:46:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2018-11-23 03:46:18,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 71 letters. Loop has 68 letters. [2018-11-23 03:46:18,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:18,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 139 letters. Loop has 68 letters. [2018-11-23 03:46:18,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:18,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 71 letters. Loop has 136 letters. [2018-11-23 03:46:18,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:46:18,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1146 states and 1366 transitions. [2018-11-23 03:46:18,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2018-11-23 03:46:18,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1146 states to 829 states and 976 transitions. [2018-11-23 03:46:18,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2018-11-23 03:46:18,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2018-11-23 03:46:18,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 829 states and 976 transitions. [2018-11-23 03:46:18,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:18,201 INFO L705 BuchiCegarLoop]: Abstraction has 829 states and 976 transitions. [2018-11-23 03:46:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states and 976 transitions. [2018-11-23 03:46:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 745. [2018-11-23 03:46:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-11-23 03:46:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 890 transitions. [2018-11-23 03:46:18,211 INFO L728 BuchiCegarLoop]: Abstraction has 745 states and 890 transitions. [2018-11-23 03:46:18,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 03:46:18,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:46:18,211 INFO L87 Difference]: Start difference. First operand 745 states and 890 transitions. Second operand 12 states. [2018-11-23 03:46:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:46:18,307 INFO L93 Difference]: Finished difference Result 295 states and 328 transitions. [2018-11-23 03:46:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 03:46:18,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 328 transitions. [2018-11-23 03:46:18,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-11-23 03:46:18,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 231 states and 264 transitions. [2018-11-23 03:46:18,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-11-23 03:46:18,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-11-23 03:46:18,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 264 transitions. [2018-11-23 03:46:18,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:46:18,312 INFO L705 BuchiCegarLoop]: Abstraction has 231 states and 264 transitions. [2018-11-23 03:46:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 264 transitions. [2018-11-23 03:46:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2018-11-23 03:46:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-23 03:46:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 257 transitions. [2018-11-23 03:46:18,320 INFO L728 BuchiCegarLoop]: Abstraction has 224 states and 257 transitions. [2018-11-23 03:46:18,320 INFO L608 BuchiCegarLoop]: Abstraction has 224 states and 257 transitions. [2018-11-23 03:46:18,320 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 03:46:18,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 257 transitions. [2018-11-23 03:46:18,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2018-11-23 03:46:18,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:46:18,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:46:18,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 2, 1, 1] [2018-11-23 03:46:18,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2018-11-23 03:46:18,322 INFO L794 eck$LassoCheckResult]: Stem: 19518#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; 19519#L18-1 assume !!(main_~i~0 > 0); 19568#L12 assume 1 == main_~i~0;main_~up~0 := 1; 19567#L12-2 assume !(10 == main_~i~0); 19566#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19565#L18-1 assume !!(main_~i~0 > 0); 19564#L12 assume !(1 == main_~i~0); 19563#L12-2 assume !(10 == main_~i~0); 19562#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19561#L18-1 assume !!(main_~i~0 > 0); 19560#L12 assume !(1 == main_~i~0); 19559#L12-2 assume !(10 == main_~i~0); 19558#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19557#L18-1 assume !!(main_~i~0 > 0); 19556#L12 assume !(1 == main_~i~0); 19555#L12-2 assume !(10 == main_~i~0); 19554#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19553#L18-1 assume !!(main_~i~0 > 0); 19552#L12 assume !(1 == main_~i~0); 19551#L12-2 assume !(10 == main_~i~0); 19550#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19549#L18-1 assume !!(main_~i~0 > 0); 19548#L12 assume !(1 == main_~i~0); 19547#L12-2 assume !(10 == main_~i~0); 19546#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19545#L18-1 assume !!(main_~i~0 > 0); 19544#L12 assume !(1 == main_~i~0); 19543#L12-2 assume !(10 == main_~i~0); 19542#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19541#L18-1 assume !!(main_~i~0 > 0); 19540#L12 assume !(1 == main_~i~0); 19539#L12-2 assume !(10 == main_~i~0); 19538#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19537#L18-1 assume !!(main_~i~0 > 0); 19534#L12 assume !(1 == main_~i~0); 19536#L12-2 assume !(10 == main_~i~0); 19535#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19533#L18-1 assume !!(main_~i~0 > 0); 19532#L12 assume !(1 == main_~i~0); 19531#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 19526#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19527#L18-1 assume !!(main_~i~0 > 0); 19709#L12 assume !(1 == main_~i~0); 19708#L12-2 assume !(10 == main_~i~0); 19707#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19706#L18-1 assume !!(main_~i~0 > 0); 19704#L12 assume !(1 == main_~i~0); 19701#L12-2 assume !(10 == main_~i~0); 19698#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19695#L18-1 assume !!(main_~i~0 > 0); 19692#L12 assume !(1 == main_~i~0); 19689#L12-2 assume !(10 == main_~i~0); 19686#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19683#L18-1 assume !!(main_~i~0 > 0); 19680#L12 assume !(1 == main_~i~0); 19677#L12-2 assume !(10 == main_~i~0); 19674#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19671#L18-1 assume !!(main_~i~0 > 0); 19668#L12 assume !(1 == main_~i~0); 19665#L12-2 assume !(10 == main_~i~0); 19662#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19659#L18-1 assume !!(main_~i~0 > 0); 19656#L12 assume !(1 == main_~i~0); 19653#L12-2 assume !(10 == main_~i~0); 19650#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19647#L18-1 assume !!(main_~i~0 > 0); 19644#L12 assume !(1 == main_~i~0); 19641#L12-2 assume !(10 == main_~i~0); 19638#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19635#L18-1 assume !!(main_~i~0 > 0); 19632#L12 assume !(1 == main_~i~0); 19621#L12-2 assume !(10 == main_~i~0); 19628#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19625#L18-1 assume !!(main_~i~0 > 0); 19620#L12 assume 1 == main_~i~0;main_~up~0 := 1; 19514#L12-2 [2018-11-23 03:46:18,322 INFO L796 eck$LassoCheckResult]: Loop: 19514#L12-2 assume !(10 == main_~i~0); 19515#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19614#L18-1 assume !!(main_~i~0 > 0); 19613#L12 assume !(1 == main_~i~0); 19612#L12-2 assume !(10 == main_~i~0); 19611#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19610#L18-1 assume !!(main_~i~0 > 0); 19609#L12 assume !(1 == main_~i~0); 19608#L12-2 assume !(10 == main_~i~0); 19607#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19606#L18-1 assume !!(main_~i~0 > 0); 19605#L12 assume !(1 == main_~i~0); 19604#L12-2 assume !(10 == main_~i~0); 19603#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19602#L18-1 assume !!(main_~i~0 > 0); 19601#L12 assume !(1 == main_~i~0); 19600#L12-2 assume !(10 == main_~i~0); 19599#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19598#L18-1 assume !!(main_~i~0 > 0); 19597#L12 assume !(1 == main_~i~0); 19596#L12-2 assume !(10 == main_~i~0); 19595#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19594#L18-1 assume !!(main_~i~0 > 0); 19593#L12 assume !(1 == main_~i~0); 19592#L12-2 assume !(10 == main_~i~0); 19591#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19590#L18-1 assume !!(main_~i~0 > 0); 19589#L12 assume !(1 == main_~i~0); 19588#L12-2 assume !(10 == main_~i~0); 19587#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19586#L18-1 assume !!(main_~i~0 > 0); 19585#L12 assume !(1 == main_~i~0); 19584#L12-2 assume !(10 == main_~i~0); 19582#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19578#L18-1 assume !!(main_~i~0 > 0); 19576#L12 assume !(1 == main_~i~0); 19577#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 19529#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19530#L18-1 assume !!(main_~i~0 > 0); 19524#L12 assume !(1 == main_~i~0); 19525#L12-2 assume !(10 == main_~i~0); 19575#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19705#L18-1 assume !!(main_~i~0 > 0); 19703#L12 assume !(1 == main_~i~0); 19700#L12-2 assume !(10 == main_~i~0); 19697#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19694#L18-1 assume !!(main_~i~0 > 0); 19691#L12 assume !(1 == main_~i~0); 19688#L12-2 assume !(10 == main_~i~0); 19685#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19682#L18-1 assume !!(main_~i~0 > 0); 19679#L12 assume !(1 == main_~i~0); 19676#L12-2 assume !(10 == main_~i~0); 19673#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19670#L18-1 assume !!(main_~i~0 > 0); 19667#L12 assume !(1 == main_~i~0); 19664#L12-2 assume !(10 == main_~i~0); 19661#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19658#L18-1 assume !!(main_~i~0 > 0); 19655#L12 assume !(1 == main_~i~0); 19652#L12-2 assume !(10 == main_~i~0); 19649#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19646#L18-1 assume !!(main_~i~0 > 0); 19643#L12 assume !(1 == main_~i~0); 19640#L12-2 assume !(10 == main_~i~0); 19637#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19634#L18-1 assume !!(main_~i~0 > 0); 19631#L12 assume !(1 == main_~i~0); 19619#L12-2 assume !(10 == main_~i~0); 19627#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19624#L18-1 assume !!(main_~i~0 > 0); 19618#L12 assume 1 == main_~i~0;main_~up~0 := 1; 19514#L12-2 [2018-11-23 03:46:18,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1439876841, now seen corresponding path program 16 times [2018-11-23 03:46:18,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:18,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:18,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:18,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:18,334 INFO L82 PathProgramCache]: Analyzing trace with hash -680570443, now seen corresponding path program 16 times [2018-11-23 03:46:18,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:18,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:18,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:18,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:18,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:18,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:46:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash -569285429, now seen corresponding path program 17 times [2018-11-23 03:46:18,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:46:18,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:46:18,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:18,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:46:18,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:46:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:46:18,712 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 66 [2018-11-23 03:46:18,941 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 68 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 ----- [2018-11-23 03:46:19,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:46:19 BoogieIcfgContainer [2018-11-23 03:46:19,071 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:46:19,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:46:19,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:46:19,072 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:46:19,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:46:07" (3/4) ... [2018-11-23 03:46:19,076 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 ----- [2018-11-23 03:46:20,084 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f3dbcda2-175a-4c9c-bd0d-5d00ee86722e/bin-2019/uautomizer/witness.graphml [2018-11-23 03:46:20,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:46:20,085 INFO L168 Benchmark]: Toolchain (without parser) took 12623.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.1 MB). Free memory was 954.8 MB in the beginning and 1.2 GB in the end (delta: -218.1 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:46:20,085 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:46:20,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.70 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:46:20,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.75 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:46:20,086 INFO L168 Benchmark]: Boogie Preprocessor took 12.29 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:46:20,090 INFO L168 Benchmark]: RCFGBuilder took 187.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:46:20,091 INFO L168 Benchmark]: BuchiAutomizer took 11204.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -43.0 MB). Peak memory consumption was 390.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:46:20,091 INFO L168 Benchmark]: Witness Printer took 1012.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:46:20,093 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 182.70 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.75 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.29 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 187.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11204.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -43.0 MB). Peak memory consumption was 390.4 MB. Max. memory is 11.5 GB. * Witness Printer took 1012.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 31 terminating modules (20 trivial, 11 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 10 locations. One deterministic module has affine ranking function i and consists of 12 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 16 locations. One deterministic module has affine ranking function i and consists of 18 locations. One deterministic module has affine ranking function i and consists of 20 locations. 20 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 224 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 23 iterations. TraceHistogramMax:19. Analysis of lassos took 7.3s. Construction of modules took 1.1s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 29. Automata minimization 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 585 StatesRemovedByMinimization, 28 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 224 states and ocurred in iteration 22. Nontrivial modules had stage [11, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 952/2604 HoareTripleCheckerStatistics: 205 SDtfs, 602 SDslu, 6 SDs, 0 SdLazy, 1900 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc0 concLT1 SILN0 SILU0 SILI9 SILT8 lasso1 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax178 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq198 hnf89 smp97 dnf110 smp98 tf111 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 88ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1685f30a=0, \result=0, i=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume !(1 == main_~i~0); [?] assume !(10 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0); [?] assume 1 == main_~i~0;main_~up~0 := 1; [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume 10 == main_~i~0; [L16] main_~up~0 := 0; [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume !(1 == main_~i~0); [L15-L17] assume !(10 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(main_~i~0 > 0); [L12-L14] assume 1 == main_~i~0; [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND TRUE 10 == main_~i~0 [L16] main_~up~0 := 0; [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND FALSE !(1 == main_~i~0) [L15] COND FALSE !(10 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(main_~i~0 > 0)) [L12] COND TRUE 1 == main_~i~0 [L13] main_~up~0 := 1; [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND TRUE 10 == ~i~0 [L16] ~up~0 := 0; [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND FALSE !(1 == ~i~0) [L15] COND FALSE !(10 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(~i~0 > 0)) [L12] COND TRUE 1 == ~i~0 [L13] ~up~0 := 1; [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 Loop: [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...