./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NarrowKonv_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NarrowKonv_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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 446a3f39420f718ff3d1f0852398f1e5da972fdc ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 13:09:44,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:09:44,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:09:44,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:09:44,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:09:44,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:09:44,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:09:44,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:09:44,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:09:44,850 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:09:44,851 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:09:44,851 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:09:44,852 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:09:44,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:09:44,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:09:44,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:09:44,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:09:44,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:09:44,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:09:44,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:09:44,863 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:09:44,864 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:09:44,865 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:09:44,866 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:09:44,866 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:09:44,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:09:44,867 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:09:44,868 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:09:44,868 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:09:44,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:09:44,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:09:44,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:09:44,870 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:09:44,871 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:09:44,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:09:44,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:09:44,872 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 13:09:44,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:09:44,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:09:44,884 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:09:44,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:09:44,884 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:09:44,884 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:09:44,884 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:09:44,884 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:09:44,885 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:09:44,885 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:09:44,885 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:09:44,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:09:44,885 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:09:44,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:09:44,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:09:44,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:09:44,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:09:44,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:09:44,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:09:44,886 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:09:44,886 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:09:44,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:09:44,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:09:44,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:09:44,887 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:09:44,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:09:44,887 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:09:44,887 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:09:44,888 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:09:44,888 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_a1ab3c2c-40a0-4228-8365-651a69d0a418/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 -> 446a3f39420f718ff3d1f0852398f1e5da972fdc [2018-11-28 13:09:44,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:09:44,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:09:44,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:09:44,921 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:09:44,921 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:09:44,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NarrowKonv_false-termination_true-no-overflow.c [2018-11-28 13:09:44,959 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/data/03eef7e93/d64e10cdc34c4c4a990a64eedbc2f303/FLAGe5de2ce07 [2018-11-28 13:09:45,355 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:09:45,355 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/sv-benchmarks/c/termination-restricted-15/NarrowKonv_false-termination_true-no-overflow.c [2018-11-28 13:09:45,359 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/data/03eef7e93/d64e10cdc34c4c4a990a64eedbc2f303/FLAGe5de2ce07 [2018-11-28 13:09:45,367 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/data/03eef7e93/d64e10cdc34c4c4a990a64eedbc2f303 [2018-11-28 13:09:45,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:09:45,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:09:45,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:45,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:09:45,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:09:45,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c466ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45, skipping insertion in model container [2018-11-28 13:09:45,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:09:45,395 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:09:45,481 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:45,483 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:09:45,493 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:45,502 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:09:45,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45 WrapperNode [2018-11-28 13:09:45,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:45,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:45,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:09:45,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:09:45,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:45,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:09:45,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:09:45,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:09:45,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... [2018-11-28 13:09:45,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:09:45,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:09:45,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:09:45,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:09:45,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:45,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:09:45,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:09:45,720 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:09:45,720 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 13:09:45,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:45 BoogieIcfgContainer [2018-11-28 13:09:45,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:09:45,721 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:09:45,721 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:09:45,725 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:09:45,725 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:09:45,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:09:45" (1/3) ... [2018-11-28 13:09:45,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b85b9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:09:45, skipping insertion in model container [2018-11-28 13:09:45,727 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:09:45,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:45" (2/3) ... [2018-11-28 13:09:45,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b85b9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:09:45, skipping insertion in model container [2018-11-28 13:09:45,727 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:09:45,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:45" (3/3) ... [2018-11-28 13:09:45,729 INFO L375 chiAutomizerObserver]: Analyzing ICFG NarrowKonv_false-termination_true-no-overflow.c [2018-11-28 13:09:45,784 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:09:45,785 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:09:45,785 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:09:45,785 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:09:45,785 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:09:45,785 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:09:45,785 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:09:45,785 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:09:45,786 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:09:45,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-28 13:09:45,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:09:45,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:45,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:45,827 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 13:09:45,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:45,828 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:09:45,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-28 13:09:45,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:09:45,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:45,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:45,829 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 13:09:45,829 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:45,837 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 4#L12-1true [2018-11-28 13:09:45,837 INFO L796 eck$LassoCheckResult]: Loop: 4#L12-1true assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6#L12true assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 4#L12-1true [2018-11-28 13:09:45,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:45,843 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 13:09:45,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:45,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:45,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:45,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:45,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 1 times [2018-11-28 13:09:45,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:45,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:45,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:45,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:45,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash 31083, now seen corresponding path program 1 times [2018-11-28 13:09:45,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:45,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:45,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:45,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:45,993 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-28 13:09:45,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:45,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-28 13:09:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:09:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:46,037 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-11-28 13:09:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:46,074 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-28 13:09:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:09:46,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-28 13:09:46,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 13:09:46,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 7 states and 10 transitions. [2018-11-28 13:09:46,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 13:09:46,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 13:09:46,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-11-28 13:09:46,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:09:46,084 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 13:09:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-11-28 13:09:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 13:09:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 13:09:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 13:09:46,102 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 13:09:46,103 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 13:09:46,103 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:09:46,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-11-28 13:09:46,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 13:09:46,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:46,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:46,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 13:09:46,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:09:46,104 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 35#L12-1 [2018-11-28 13:09:46,104 INFO L796 eck$LassoCheckResult]: Loop: 35#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 39#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35#L12-1 [2018-11-28 13:09:46,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,104 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-28 13:09:46,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:46,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash 39822, now seen corresponding path program 1 times [2018-11-28 13:09:46,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash 963343, now seen corresponding path program 1 times [2018-11-28 13:09:46,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,170 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:46,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:46,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:46,172 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:46,172 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:09:46,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:46,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:46,172 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:46,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: NarrowKonv_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 13:09:46,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:46,173 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:46,186 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-28 13:09:46,194 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-28 13:09:46,196 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-28 13:09:46,310 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:46,314 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:46,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:09:46,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:09:46,347 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:09:46,347 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:46,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:09:46,350 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:09:46,366 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:09:46,366 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:46,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:09:46,370 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:46,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:09:46,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:09:46,422 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:09:46,423 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:46,423 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:46,423 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:46,423 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:46,423 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:46,423 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:46,423 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:46,423 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:46,423 INFO L131 ssoRankerPreferences]: Filename of dumped script: NarrowKonv_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 13:09:46,423 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:46,423 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:46,425 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-28 13:09:46,430 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-28 13:09:46,432 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-28 13:09:46,475 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:46,478 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:46,479 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-28 13:09:46,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:46,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:46,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:46,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:46,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:46,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:46,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:46,489 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-28 13:09:46,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:46,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:46,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:46,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:46,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:46,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:46,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:46,499 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-28 13:09:46,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:46,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:46,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:46,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:46,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:46,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:46,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:46,506 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:46,513 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:09:46,513 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:09:46,515 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:46,515 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:09:46,515 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:46,515 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2018-11-28 13:09:46,517 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:09:46,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:46,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:46,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:46,589 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-28 13:09:46,591 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-28 13:09:46,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 13:09:46,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2018-11-28 13:09:46,617 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-28 13:09:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:09:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 13:09:46,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 1 letters. Loop has 3 letters. [2018-11-28 13:09:46,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:46,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 13:09:46,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:46,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 1 letters. Loop has 6 letters. [2018-11-28 13:09:46,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:46,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2018-11-28 13:09:46,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:09:46,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2018-11-28 13:09:46,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 13:09:46,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 13:09:46,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2018-11-28 13:09:46,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:46,622 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2018-11-28 13:09:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2018-11-28 13:09:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 13:09:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 13:09:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-11-28 13:09:46,624 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2018-11-28 13:09:46,624 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2018-11-28 13:09:46,624 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:09:46,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2018-11-28 13:09:46,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:09:46,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:46,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:46,625 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:09:46,625 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:46,625 INFO L794 eck$LassoCheckResult]: Stem: 84#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 85#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 90#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 91#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 86#L12-1 [2018-11-28 13:09:46,625 INFO L796 eck$LassoCheckResult]: Loop: 86#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 87#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 86#L12-1 [2018-11-28 13:09:46,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash 963341, now seen corresponding path program 1 times [2018-11-28 13:09:46,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 2 times [2018-11-28 13:09:46,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash 925771032, now seen corresponding path program 1 times [2018-11-28 13:09:46,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:46,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:46,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:46,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:09:46,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:46,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:46,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:46,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-11-28 13:09:46,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:46,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:46,727 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 13:09:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:46,745 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2018-11-28 13:09:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:09:46,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-28 13:09:46,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:09:46,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2018-11-28 13:09:46,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 13:09:46,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:09:46,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-28 13:09:46,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:46,748 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 13:09:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-28 13:09:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 13:09:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 13:09:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-28 13:09:46,749 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 13:09:46,750 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 13:09:46,750 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:09:46,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-28 13:09:46,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:09:46,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:46,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:46,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2018-11-28 13:09:46,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:46,751 INFO L794 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 142#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 134#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 139#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 141#L12-1 [2018-11-28 13:09:46,751 INFO L796 eck$LassoCheckResult]: Loop: 141#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 144#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 141#L12-1 [2018-11-28 13:09:46,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1365869310, now seen corresponding path program 1 times [2018-11-28 13:09:46,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:46,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 3 times [2018-11-28 13:09:46,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:46,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1659585997, now seen corresponding path program 1 times [2018-11-28 13:09:46,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:46,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:46,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:09:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:46,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:46,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:09:46,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-28 13:09:46,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:46,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:46,877 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 13:09:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:46,958 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2018-11-28 13:09:46,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:09:46,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2018-11-28 13:09:46,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 13:09:46,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2018-11-28 13:09:46,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 13:09:46,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 13:09:46,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-28 13:09:46,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:46,962 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 13:09:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-28 13:09:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-11-28 13:09:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 13:09:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 13:09:46,964 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 13:09:46,964 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 13:09:46,964 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:09:46,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 13:09:46,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:09:46,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:46,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:46,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2018-11-28 13:09:46,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:09:46,966 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 200#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 205#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 206#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 209#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 213#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 208#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 201#L12-1 [2018-11-28 13:09:46,967 INFO L796 eck$LassoCheckResult]: Loop: 201#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 202#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 210#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 201#L12-1 [2018-11-28 13:09:46,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1365869310, now seen corresponding path program 2 times [2018-11-28 13:09:46,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:46,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 39822, now seen corresponding path program 2 times [2018-11-28 13:09:46,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash -92441875, now seen corresponding path program 3 times [2018-11-28 13:09:46,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:46,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:46,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:46,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,021 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:47,021 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:47,021 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:47,021 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:47,021 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:09:47,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:47,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:47,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:47,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: NarrowKonv_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 13:09:47,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:47,022 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:47,024 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-28 13:09:47,027 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-28 13:09:47,029 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-28 13:09:47,074 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:47,074 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:47,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:09:47,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:09:47,092 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:09:47,092 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_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:47,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:09:47,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:09:47,109 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:09:47,109 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_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:47,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:09:47,112 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:47,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:09:47,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:09:47,155 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:09:47,156 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:47,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:47,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:47,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:47,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:47,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:47,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:47,156 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:47,156 INFO L131 ssoRankerPreferences]: Filename of dumped script: NarrowKonv_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 13:09:47,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:47,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:47,157 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-28 13:09:47,159 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-28 13:09:47,163 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-28 13:09:47,211 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:47,211 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:47,211 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-28 13:09:47,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:47,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:47,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:47,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:47,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:47,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:47,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:47,216 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-28 13:09:47,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:47,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:47,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:47,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:47,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:47,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:47,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:47,226 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-28 13:09:47,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:47,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:47,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:47,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:47,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:47,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:47,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:47,231 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:47,233 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:09:47,233 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:09:47,234 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:47,234 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:09:47,234 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:47,234 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~range~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 13:09:47,234 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:09:47,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,260 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-28 13:09:47,260 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-28 13:09:47,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 13:09:47,271 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 32 states and 38 transitions. Complement of second has 5 states. [2018-11-28 13:09:47,271 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-28 13:09:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:09:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 13:09:47,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 13:09:47,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 13:09:47,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 13:09:47,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 38 transitions. [2018-11-28 13:09:47,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:09:47,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 34 transitions. [2018-11-28 13:09:47,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 13:09:47,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 13:09:47,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2018-11-28 13:09:47,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:47,275 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-28 13:09:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2018-11-28 13:09:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-28 13:09:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 13:09:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-28 13:09:47,277 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 13:09:47,277 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 13:09:47,278 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:09:47,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-11-28 13:09:47,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:09:47,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:47,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:47,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1] [2018-11-28 13:09:47,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:09:47,279 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 298#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 305#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 306#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 322#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 321#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 320#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 319#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 318#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 307#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 299#L12-1 [2018-11-28 13:09:47,279 INFO L796 eck$LassoCheckResult]: Loop: 299#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 300#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 316#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 299#L12-1 [2018-11-28 13:09:47,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1682505905, now seen corresponding path program 4 times [2018-11-28 13:09:47,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:47,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash 39822, now seen corresponding path program 3 times [2018-11-28 13:09:47,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:47,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1265081566, now seen corresponding path program 5 times [2018-11-28 13:09:47,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:47,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,326 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:47,326 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:47,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:47,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:47,327 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:09:47,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:47,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:47,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:47,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: NarrowKonv_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 13:09:47,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:47,327 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:47,328 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-28 13:09:47,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-28 13:09:47,345 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-28 13:09:47,381 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:47,381 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:47,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:09:47,387 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:47,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:09:47,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:09:47,435 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:09:47,437 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:47,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:47,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:47,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:47,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:47,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:47,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:47,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:47,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: NarrowKonv_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 13:09:47,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:47,438 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:47,439 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-28 13:09:47,444 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-28 13:09:47,446 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-28 13:09:47,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:47,470 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:47,470 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-28 13:09:47,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:47,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:47,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:47,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:47,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:47,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:47,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:47,473 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:47,475 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:09:47,475 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:09:47,475 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:47,475 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:09:47,476 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:47,476 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2018-11-28 13:09:47,476 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:09:47,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,500 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-28 13:09:47,500 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-28 13:09:47,500 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 13:09:47,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 44 transitions. Complement of second has 5 states. [2018-11-28 13:09:47,512 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-28 13:09:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:09:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 13:09:47,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 13:09:47,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,512 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:09:47,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,537 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-28 13:09:47,537 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:09:47,537 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 13:09:47,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 44 transitions. Complement of second has 5 states. [2018-11-28 13:09:47,546 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-28 13:09:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:09:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 13:09:47,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 13:09:47,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,546 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:09:47,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,572 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-28 13:09:47,572 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:09:47,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 13:09:47,582 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 50 transitions. Complement of second has 4 states. [2018-11-28 13:09:47,582 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-28 13:09:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:09:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 13:09:47,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 13:09:47,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-28 13:09:47,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 13:09:47,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2018-11-28 13:09:47,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 13:09:47,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 40 transitions. [2018-11-28 13:09:47,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 13:09:47,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 13:09:47,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2018-11-28 13:09:47,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:47,585 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-28 13:09:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2018-11-28 13:09:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-11-28 13:09:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 13:09:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-28 13:09:47,587 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-28 13:09:47,587 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-28 13:09:47,587 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:09:47,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-28 13:09:47,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 13:09:47,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:47,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:47,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2018-11-28 13:09:47,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-28 13:09:47,588 INFO L794 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 585#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 590#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 591#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 586#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 587#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 595#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 596#L12-1 [2018-11-28 13:09:47,588 INFO L796 eck$LassoCheckResult]: Loop: 596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 600#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 598#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 599#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 596#L12-1 [2018-11-28 13:09:47,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1365869310, now seen corresponding path program 6 times [2018-11-28 13:09:47,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:47,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:47,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:47,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1186287651, now seen corresponding path program 1 times [2018-11-28 13:09:47,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:47,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:47,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,601 INFO L82 PathProgramCache]: Analyzing trace with hash -861910940, now seen corresponding path program 7 times [2018-11-28 13:09:47,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:47,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:47,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:47,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:47,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:47,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:09:47,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:47,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:47,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-28 13:09:47,731 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:47,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:47,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:47,732 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:47,732 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:09:47,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:47,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:47,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:47,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: NarrowKonv_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 13:09:47,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:47,732 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:47,733 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-28 13:09:47,739 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-28 13:09:47,741 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-28 13:09:47,776 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:47,776 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:47,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:09:47,791 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:47,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:09:47,816 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:09:47,876 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:09:47,878 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:47,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:47,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:47,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:47,878 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:47,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:47,878 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:47,878 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:47,878 INFO L131 ssoRankerPreferences]: Filename of dumped script: NarrowKonv_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 13:09:47,878 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:47,878 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:47,880 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-28 13:09:47,887 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-28 13:09:47,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:47,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:47,924 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:47,924 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-28 13:09:47,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:47,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:47,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:47,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:47,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:47,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:47,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:47,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:47,930 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:09:47,930 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:09:47,931 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:47,931 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:09:47,931 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:47,931 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0) = 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2018-11-28 13:09:47,931 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:09:47,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:47,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:47,964 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-28 13:09:47,964 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 13:09:47,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 48 states and 65 transitions. Complement of second has 4 states. [2018-11-28 13:09:47,975 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-28 13:09:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:09:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-28 13:09:47,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 13:09:47,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-28 13:09:47,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 12 letters. [2018-11-28 13:09:47,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:47,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2018-11-28 13:09:47,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:47,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 41 transitions. [2018-11-28 13:09:47,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:47,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 13:09:47,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2018-11-28 13:09:47,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:47,982 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-28 13:09:47,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2018-11-28 13:09:47,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2018-11-28 13:09:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 13:09:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-11-28 13:09:47,984 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-28 13:09:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:09:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:47,985 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 9 states. [2018-11-28 13:09:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:48,014 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-28 13:09:48,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:09:48,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-28 13:09:48,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:48,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 39 transitions. [2018-11-28 13:09:48,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:48,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:48,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-11-28 13:09:48,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:48,017 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-28 13:09:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-11-28 13:09:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-28 13:09:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 13:09:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-28 13:09:48,019 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-28 13:09:48,019 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-28 13:09:48,019 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 13:09:48,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2018-11-28 13:09:48,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:48,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:48,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:48,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 3, 2, 1] [2018-11-28 13:09:48,021 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:48,021 INFO L794 eck$LassoCheckResult]: Stem: 815#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 816#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 829#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 834#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 835#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 827#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 825#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 817#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 818#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 845#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 819#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 820#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 841#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 840#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 839#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 838#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 830#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 832#L12 [2018-11-28 13:09:48,021 INFO L796 eck$LassoCheckResult]: Loop: 832#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 833#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 832#L12 [2018-11-28 13:09:48,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1216646815, now seen corresponding path program 8 times [2018-11-28 13:09:48,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:48,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:48,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:48,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:48,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:48,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:09:48,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:09:48,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:09:48,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:48,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:48,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:48,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-28 13:09:48,176 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:48,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 4 times [2018-11-28 13:09:48,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:48,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:48,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:48,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:48,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:09:48,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:09:48,189 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-28 13:09:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:48,231 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-28 13:09:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:09:48,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2018-11-28 13:09:48,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:48,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 45 transitions. [2018-11-28 13:09:48,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:48,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:48,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2018-11-28 13:09:48,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:48,233 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-28 13:09:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2018-11-28 13:09:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-28 13:09:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 13:09:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-28 13:09:48,235 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-28 13:09:48,235 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-28 13:09:48,235 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 13:09:48,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2018-11-28 13:09:48,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:48,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:48,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:48,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 5, 2, 1] [2018-11-28 13:09:48,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:48,237 INFO L794 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 954#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 965#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 970#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 963#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 962#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 955#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 956#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 988#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 987#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 986#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 984#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 982#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 981#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 977#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 978#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 976#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 975#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 974#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 966#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 967#L12 [2018-11-28 13:09:48,237 INFO L796 eck$LassoCheckResult]: Loop: 967#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 969#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 967#L12 [2018-11-28 13:09:48,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:48,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1280613055, now seen corresponding path program 9 times [2018-11-28 13:09:48,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:48,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:48,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:48,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:48,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:48,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:09:48,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:09:48,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-28 13:09:48,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:48,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:48,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:48,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-28 13:09:48,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:48,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 5 times [2018-11-28 13:09:48,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:48,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:09:48,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:09:48,401 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 9 Second operand 17 states. [2018-11-28 13:09:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:48,448 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-28 13:09:48,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:09:48,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2018-11-28 13:09:48,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:48,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 45 states and 51 transitions. [2018-11-28 13:09:48,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:48,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:48,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2018-11-28 13:09:48,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:48,450 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-28 13:09:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2018-11-28 13:09:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-28 13:09:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 13:09:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-28 13:09:48,453 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-28 13:09:48,453 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-28 13:09:48,453 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 13:09:48,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2018-11-28 13:09:48,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:48,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:48,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:48,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 7, 2, 1] [2018-11-28 13:09:48,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:48,454 INFO L794 eck$LassoCheckResult]: Stem: 1125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1126#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1142#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1141#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1128#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1166#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1165#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1164#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1163#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1162#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1161#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1160#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1159#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1158#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1157#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1156#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1155#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1154#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1153#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1149#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1151#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1148#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1147#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1145#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1138#L12 [2018-11-28 13:09:48,454 INFO L796 eck$LassoCheckResult]: Loop: 1138#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1137#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1138#L12 [2018-11-28 13:09:48,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1682764065, now seen corresponding path program 10 times [2018-11-28 13:09:48,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:48,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:48,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:48,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 13:09:48,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 13:09:48,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:48,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:48,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:48,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-28 13:09:48,635 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:48,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:48,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 6 times [2018-11-28 13:09:48,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:48,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:48,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:48,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:48,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 13:09:48,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=256, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:09:48,653 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. cyclomatic complexity: 9 Second operand 21 states. [2018-11-28 13:09:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:48,729 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-28 13:09:48,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:09:48,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 61 transitions. [2018-11-28 13:09:48,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:48,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 51 states and 57 transitions. [2018-11-28 13:09:48,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:48,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:48,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 57 transitions. [2018-11-28 13:09:48,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:48,731 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-28 13:09:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 57 transitions. [2018-11-28 13:09:48,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-28 13:09:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 13:09:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-28 13:09:48,734 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-28 13:09:48,734 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-28 13:09:48,734 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 13:09:48,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2018-11-28 13:09:48,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:48,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:48,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:48,736 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 9, 2, 1] [2018-11-28 13:09:48,736 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:48,736 INFO L794 eck$LassoCheckResult]: Stem: 1331#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1332#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1348#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1347#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1342#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1341#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1340#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1333#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1334#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1378#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1377#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1376#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1375#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1374#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1373#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1372#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1371#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1370#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1369#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1368#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1367#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1366#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1365#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1364#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1363#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1362#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1361#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1360#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1359#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1355#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1357#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1354#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1351#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1344#L12 [2018-11-28 13:09:48,736 INFO L796 eck$LassoCheckResult]: Loop: 1344#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1343#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1344#L12 [2018-11-28 13:09:48,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:48,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1546775295, now seen corresponding path program 11 times [2018-11-28 13:09:48,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:48,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:48,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:48,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:48,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:48,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:48,905 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 13:09:48,946 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-28 13:09:48,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:48,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:49,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:49,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-11-28 13:09:49,110 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:49,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:49,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 7 times [2018-11-28 13:09:49,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:49,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:49,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:49,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:49,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 13:09:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=367, Unknown=0, NotChecked=0, Total=600 [2018-11-28 13:09:49,130 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. cyclomatic complexity: 9 Second operand 25 states. [2018-11-28 13:09:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:49,249 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-11-28 13:09:49,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:09:49,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 67 transitions. [2018-11-28 13:09:49,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:49,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 57 states and 63 transitions. [2018-11-28 13:09:49,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:49,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:49,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 63 transitions. [2018-11-28 13:09:49,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:49,252 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-28 13:09:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 63 transitions. [2018-11-28 13:09:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-28 13:09:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 13:09:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-11-28 13:09:49,254 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-11-28 13:09:49,255 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-11-28 13:09:49,255 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 13:09:49,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 61 transitions. [2018-11-28 13:09:49,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:49,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:49,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:49,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 11, 2, 1] [2018-11-28 13:09:49,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:49,256 INFO L794 eck$LassoCheckResult]: Stem: 1571#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1588#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1587#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1582#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1581#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1580#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1573#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1574#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1624#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1623#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1622#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1621#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1620#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1619#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1618#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1617#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1616#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1615#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1614#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1613#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1612#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1611#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1610#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1609#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1608#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1607#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1606#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1605#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1603#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1602#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1600#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1594#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1593#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1591#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1585#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1584#L12 [2018-11-28 13:09:49,256 INFO L796 eck$LassoCheckResult]: Loop: 1584#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1583#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1584#L12 [2018-11-28 13:09:49,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1109184737, now seen corresponding path program 12 times [2018-11-28 13:09:49,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:49,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:49,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:49,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:49,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:49,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:49,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:49,387 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 13:09:49,434 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-28 13:09:49,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:49,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:49,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:49,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-11-28 13:09:49,585 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:49,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 8 times [2018-11-28 13:09:49,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:49,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:49,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:49,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 13:09:49,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=498, Unknown=0, NotChecked=0, Total=812 [2018-11-28 13:09:49,600 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. cyclomatic complexity: 9 Second operand 29 states. [2018-11-28 13:09:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:49,721 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-28 13:09:49,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:09:49,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 73 transitions. [2018-11-28 13:09:49,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:49,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 63 states and 69 transitions. [2018-11-28 13:09:49,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:49,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:49,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 69 transitions. [2018-11-28 13:09:49,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:49,724 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-11-28 13:09:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 69 transitions. [2018-11-28 13:09:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-28 13:09:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 13:09:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-11-28 13:09:49,729 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-28 13:09:49,729 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-28 13:09:49,729 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 13:09:49,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 67 transitions. [2018-11-28 13:09:49,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:49,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:49,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:49,734 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 13, 2, 1] [2018-11-28 13:09:49,734 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:49,734 INFO L794 eck$LassoCheckResult]: Stem: 1845#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1846#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1861#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1856#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1855#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1854#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1847#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1848#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1904#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1903#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1902#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1901#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1900#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1899#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1898#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1897#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1896#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1895#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1894#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1893#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1892#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1891#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1890#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1889#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1888#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1887#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1886#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1884#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1883#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1882#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1881#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1880#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1879#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1878#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1877#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1876#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1875#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1874#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1873#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1869#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1871#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1868#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1867#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1865#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1859#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1858#L12 [2018-11-28 13:09:49,734 INFO L796 eck$LassoCheckResult]: Loop: 1858#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1857#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1858#L12 [2018-11-28 13:09:49,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash 458808127, now seen corresponding path program 13 times [2018-11-28 13:09:49,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:49,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:49,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:49,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:49,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 15 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:49,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:49,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:49,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:49,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 15 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:50,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:50,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-11-28 13:09:50,069 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:50,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 9 times [2018-11-28 13:09:50,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:50,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:50,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:50,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 13:09:50,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=649, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 13:09:50,081 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. cyclomatic complexity: 9 Second operand 33 states. [2018-11-28 13:09:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:50,146 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-28 13:09:50,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 13:09:50,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions. [2018-11-28 13:09:50,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:50,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 69 states and 75 transitions. [2018-11-28 13:09:50,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:50,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:50,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 75 transitions. [2018-11-28 13:09:50,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:50,147 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-11-28 13:09:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 75 transitions. [2018-11-28 13:09:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-28 13:09:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 13:09:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-11-28 13:09:50,149 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-28 13:09:50,149 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-28 13:09:50,150 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 13:09:50,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 73 transitions. [2018-11-28 13:09:50,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:50,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:50,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:50,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 15, 2, 1] [2018-11-28 13:09:50,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:50,151 INFO L794 eck$LassoCheckResult]: Stem: 2153#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 2154#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2164#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2170#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2171#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2163#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2162#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2155#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2156#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2218#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2217#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2216#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2215#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2213#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2212#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2211#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2210#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2209#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2208#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2207#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2206#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2205#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2204#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2203#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2202#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2201#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2200#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2199#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2198#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2197#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2196#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2195#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2194#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2191#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2190#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2189#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2188#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2186#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2185#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2181#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2177#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2178#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2176#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2175#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2174#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2166#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2167#L12 [2018-11-28 13:09:50,151 INFO L796 eck$LassoCheckResult]: Loop: 2167#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 2169#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2167#L12 [2018-11-28 13:09:50,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:50,151 INFO L82 PathProgramCache]: Analyzing trace with hash 430239583, now seen corresponding path program 14 times [2018-11-28 13:09:50,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:50,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:50,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:50,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:50,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 17 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:50,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:50,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:50,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:09:50,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:09:50,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:50,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 17 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:50,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:50,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-11-28 13:09:50,534 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:50,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:50,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 10 times [2018-11-28 13:09:50,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:50,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:50,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:50,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:50,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 13:09:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 13:09:50,545 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. cyclomatic complexity: 9 Second operand 37 states. [2018-11-28 13:09:50,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:50,622 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-11-28 13:09:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:09:50,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2018-11-28 13:09:50,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:50,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 75 states and 81 transitions. [2018-11-28 13:09:50,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:50,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:50,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 81 transitions. [2018-11-28 13:09:50,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:50,625 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-11-28 13:09:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 81 transitions. [2018-11-28 13:09:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-28 13:09:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 13:09:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-11-28 13:09:50,627 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-11-28 13:09:50,628 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-11-28 13:09:50,628 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 13:09:50,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 79 transitions. [2018-11-28 13:09:50,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:50,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:50,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:50,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 19, 17, 2, 1] [2018-11-28 13:09:50,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:50,629 INFO L794 eck$LassoCheckResult]: Stem: 2495#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 2496#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2506#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2512#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2513#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2505#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2504#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2497#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2498#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2566#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2565#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2564#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2561#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2560#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2559#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2557#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2556#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2555#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2554#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2553#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2552#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2551#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2550#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2549#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2548#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2547#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2546#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2545#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2544#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2543#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2542#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2539#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2537#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2536#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2535#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2534#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2533#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2532#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2531#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2530#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2529#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2528#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2527#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2526#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2525#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2524#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2523#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2519#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2520#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2518#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2517#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2516#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2508#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2509#L12 [2018-11-28 13:09:50,629 INFO L796 eck$LassoCheckResult]: Loop: 2509#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 2511#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2509#L12 [2018-11-28 13:09:50,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:50,629 INFO L82 PathProgramCache]: Analyzing trace with hash -933663873, now seen corresponding path program 15 times [2018-11-28 13:09:50,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:50,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:50,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:50,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:50,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 19 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:50,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:50,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:50,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:09:50,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-28 13:09:50,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:50,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 19 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:51,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:51,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2018-11-28 13:09:51,025 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:51,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:51,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 11 times [2018-11-28 13:09:51,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:51,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:51,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:51,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:51,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-28 13:09:51,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=1011, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 13:09:51,034 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. cyclomatic complexity: 9 Second operand 41 states. [2018-11-28 13:09:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:51,137 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-28 13:09:51,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 13:09:51,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 91 transitions. [2018-11-28 13:09:51,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:51,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 81 states and 87 transitions. [2018-11-28 13:09:51,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:51,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:51,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 87 transitions. [2018-11-28 13:09:51,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:51,138 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-11-28 13:09:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 87 transitions. [2018-11-28 13:09:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-28 13:09:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 13:09:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-11-28 13:09:51,140 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-11-28 13:09:51,140 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-11-28 13:09:51,140 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 13:09:51,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 85 transitions. [2018-11-28 13:09:51,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:51,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:51,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:51,142 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [22, 21, 19, 2, 1] [2018-11-28 13:09:51,142 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:51,142 INFO L794 eck$LassoCheckResult]: Stem: 2871#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 2872#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2888#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2889#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2881#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2880#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2873#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2874#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2947#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2946#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2945#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2942#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2940#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2939#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2937#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2936#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2935#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2934#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2933#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2931#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2930#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2929#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2928#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2927#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2923#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2922#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2921#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2920#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2919#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2918#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2915#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2913#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2912#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2909#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2908#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2907#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2906#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2905#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2904#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2903#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2902#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2901#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2900#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2899#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2896#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2894#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2893#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2892#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2884#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2885#L12 [2018-11-28 13:09:51,142 INFO L796 eck$LassoCheckResult]: Loop: 2885#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 2887#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2885#L12 [2018-11-28 13:09:51,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1048031329, now seen corresponding path program 16 times [2018-11-28 13:09:51,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:51,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:51,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:51,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 12 times [2018-11-28 13:09:51,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:51,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:51,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:51,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:51,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:51,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2135759244, now seen corresponding path program 2 times [2018-11-28 13:09:51,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:51,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 22 proven. 102 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-28 13:09:51,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:51,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:51,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:09:51,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:09:51,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:51,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 22 proven. 102 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-28 13:09:51,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:51,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 13:09:51,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:09:51,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:09:51,277 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-28 13:09:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:51,298 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-11-28 13:09:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:09:51,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 95 transitions. [2018-11-28 13:09:51,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:51,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 94 transitions. [2018-11-28 13:09:51,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:51,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:51,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 94 transitions. [2018-11-28 13:09:51,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:51,301 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-11-28 13:09:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 94 transitions. [2018-11-28 13:09:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-28 13:09:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 13:09:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-11-28 13:09:51,304 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-11-28 13:09:51,304 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-11-28 13:09:51,304 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 13:09:51,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 92 transitions. [2018-11-28 13:09:51,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:51,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:51,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:51,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 23, 20, 3, 1] [2018-11-28 13:09:51,305 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:51,306 INFO L794 eck$LassoCheckResult]: Stem: 3249#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 3250#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3260#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3266#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 3267#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3259#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3258#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3251#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3252#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3332#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3331#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3330#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3329#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3328#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3327#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3326#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3325#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3324#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3323#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3322#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3321#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3320#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3319#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3318#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3316#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3315#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3314#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3313#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3312#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3311#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3309#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3308#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3307#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3306#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3305#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3304#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3303#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3302#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3301#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3300#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3299#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3298#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3297#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3296#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3295#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3294#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3293#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3292#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3291#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3290#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3289#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3288#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3287#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3286#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3285#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3284#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3283#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3281#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3282#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3279#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3278#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 3277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3272#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3271#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3270#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 3262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3263#L12 [2018-11-28 13:09:51,306 INFO L796 eck$LassoCheckResult]: Loop: 3263#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 3265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3263#L12 [2018-11-28 13:09:51,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2046902785, now seen corresponding path program 17 times [2018-11-28 13:09:51,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:51,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 23 proven. 189 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-28 13:09:51,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:51,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:51,374 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 13:09:51,394 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-28 13:09:51,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:51,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 622 proven. 159 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:51,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:51,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 25] total 30 [2018-11-28 13:09:51,612 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:51,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 13 times [2018-11-28 13:09:51,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:51,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:51,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-28 13:09:51,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=607, Unknown=0, NotChecked=0, Total=870 [2018-11-28 13:09:51,625 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. cyclomatic complexity: 11 Second operand 30 states. [2018-11-28 13:09:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:52,278 INFO L93 Difference]: Finished difference Result 299 states and 343 transitions. [2018-11-28 13:09:52,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-28 13:09:52,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 299 states and 343 transitions. [2018-11-28 13:09:52,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:52,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 299 states to 290 states and 334 transitions. [2018-11-28 13:09:52,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 13:09:52,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 13:09:52,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 334 transitions. [2018-11-28 13:09:52,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:52,282 INFO L705 BuchiCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-11-28 13:09:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 334 transitions. [2018-11-28 13:09:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 151. [2018-11-28 13:09:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-28 13:09:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2018-11-28 13:09:52,286 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 175 transitions. [2018-11-28 13:09:52,286 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 175 transitions. [2018-11-28 13:09:52,286 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 13:09:52,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 175 transitions. [2018-11-28 13:09:52,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:52,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:52,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:52,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [28, 27, 23, 4, 1] [2018-11-28 13:09:52,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:52,292 INFO L794 eck$LassoCheckResult]: Stem: 4007#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 4008#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4020#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4016#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4017#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4019#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4009#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4010#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4153#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4152#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4151#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4150#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4149#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4146#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4145#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4143#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4142#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4141#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4140#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4139#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4138#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4137#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4136#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4135#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4134#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4133#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4132#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4131#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4130#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4129#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4128#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4127#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4126#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4125#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4124#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4123#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4122#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4121#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4120#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4119#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4118#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4117#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4116#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4115#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4114#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4113#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4112#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4111#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4110#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4109#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4108#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4107#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4106#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4105#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4104#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4103#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4102#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4101#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4100#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4099#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4098#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4093#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4088#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4041#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4040#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4084#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4083#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4035#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4034#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4033#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4031#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4028#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4029#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4026#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4025#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4023#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4021#L12 [2018-11-28 13:09:52,292 INFO L796 eck$LassoCheckResult]: Loop: 4021#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 4022#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4021#L12 [2018-11-28 13:09:52,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1893636733, now seen corresponding path program 18 times [2018-11-28 13:09:52,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:52,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:52,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 175 proven. 330 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2018-11-28 13:09:52,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:52,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:52,368 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 13:09:52,422 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-28 13:09:52,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:52,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 404 proven. 25 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-11-28 13:09:52,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:52,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-11-28 13:09:52,514 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:52,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:52,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 14 times [2018-11-28 13:09:52,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:52,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:52,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:52,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 13:09:52,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:09:52,535 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. cyclomatic complexity: 27 Second operand 16 states. [2018-11-28 13:09:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:52,773 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-11-28 13:09:52,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 13:09:52,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 224 transitions. [2018-11-28 13:09:52,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:52,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 191 states and 218 transitions. [2018-11-28 13:09:52,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 13:09:52,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 13:09:52,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 218 transitions. [2018-11-28 13:09:52,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:52,776 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 218 transitions. [2018-11-28 13:09:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 218 transitions. [2018-11-28 13:09:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 169. [2018-11-28 13:09:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-28 13:09:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2018-11-28 13:09:52,779 INFO L728 BuchiCegarLoop]: Abstraction has 169 states and 194 transitions. [2018-11-28 13:09:52,779 INFO L608 BuchiCegarLoop]: Abstraction has 169 states and 194 transitions. [2018-11-28 13:09:52,779 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 13:09:52,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 194 transitions. [2018-11-28 13:09:52,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:52,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:52,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:52,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [33, 32, 27, 5, 1] [2018-11-28 13:09:52,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:52,782 INFO L794 eck$LassoCheckResult]: Stem: 4656#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 4657#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4672#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4673#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4666#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4665#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4658#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4659#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4823#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4822#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4821#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4820#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4819#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4818#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4817#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4816#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4815#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4814#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4813#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4812#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4811#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4810#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4809#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4808#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4807#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4806#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4805#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4804#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4803#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4802#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4801#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4800#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4799#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4798#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4797#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4796#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4795#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4793#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4792#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4791#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4790#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4789#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4788#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4787#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4786#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4785#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4784#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4783#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4782#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4781#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4780#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4779#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4778#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4777#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4776#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4775#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4774#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4772#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4773#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4771#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4770#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4769#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4768#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4767#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4766#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4765#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4764#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4763#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4761#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4759#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4757#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4755#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4747#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4744#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4745#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4746#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4743#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4742#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4695#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4694#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4693#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4692#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4691#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4690#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4684#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4689#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4687#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4686#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4685#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4683#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4682#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4679#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4680#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4676#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4674#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4671#L12 [2018-11-28 13:09:52,782 INFO L796 eck$LassoCheckResult]: Loop: 4671#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 4670#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4671#L12 [2018-11-28 13:09:52,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:52,782 INFO L82 PathProgramCache]: Analyzing trace with hash 283055080, now seen corresponding path program 19 times [2018-11-28 13:09:52,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:52,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:52,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:52,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:52,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 432 proven. 483 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-11-28 13:09:52,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:52,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:52,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 432 proven. 483 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-11-28 13:09:52,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:52,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-28 13:09:52,992 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:52,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:52,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 15 times [2018-11-28 13:09:52,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:52,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:52,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:52,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:52,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:53,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 13:09:53,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:09:53,004 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. cyclomatic complexity: 29 Second operand 18 states. [2018-11-28 13:09:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:53,113 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2018-11-28 13:09:53,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 13:09:53,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 206 transitions. [2018-11-28 13:09:53,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:53,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 177 states and 202 transitions. [2018-11-28 13:09:53,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:53,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:53,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 202 transitions. [2018-11-28 13:09:53,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:53,115 INFO L705 BuchiCegarLoop]: Abstraction has 177 states and 202 transitions. [2018-11-28 13:09:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 202 transitions. [2018-11-28 13:09:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-28 13:09:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-28 13:09:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2018-11-28 13:09:53,118 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 200 transitions. [2018-11-28 13:09:53,118 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 200 transitions. [2018-11-28 13:09:53,118 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 13:09:53,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 200 transitions. [2018-11-28 13:09:53,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:53,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:53,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:53,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [35, 34, 29, 5, 1] [2018-11-28 13:09:53,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:53,120 INFO L794 eck$LassoCheckResult]: Stem: 5334#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 5335#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5350#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5343#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5336#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5337#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5507#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5506#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5505#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5504#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5503#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5502#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5501#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5500#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5499#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5498#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5497#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5496#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5494#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5493#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5492#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5491#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5490#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5489#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5488#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5487#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5486#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5485#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5484#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5483#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5482#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5481#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5480#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5479#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5478#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5477#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5476#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5475#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5474#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5473#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5472#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5471#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5470#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5469#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5468#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5467#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5466#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5465#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5464#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5463#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5462#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5461#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5460#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5459#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5458#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5456#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5457#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5455#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5454#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5453#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5452#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5451#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5450#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5449#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5447#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5445#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5443#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5441#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5440#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5438#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5437#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5436#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5434#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5431#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5428#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5425#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5418#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5415#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5416#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5417#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5414#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5413#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5373#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5372#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5371#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5370#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5358#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5368#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5366#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5364#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5359#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5357#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5356#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5354#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5348#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5347#L12 [2018-11-28 13:09:53,120 INFO L796 eck$LassoCheckResult]: Loop: 5347#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 5346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5347#L12 [2018-11-28 13:09:53,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2102987448, now seen corresponding path program 20 times [2018-11-28 13:09:53,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:53,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:53,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 464 proven. 648 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-11-28 13:09:53,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:53,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:53,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:09:53,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:09:53,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:53,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 464 proven. 648 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-11-28 13:09:53,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:53,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-11-28 13:09:53,326 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:53,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:53,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 16 times [2018-11-28 13:09:53,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:53,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:53,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:53,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:53,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 13:09:53,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:09:53,337 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. cyclomatic complexity: 29 Second operand 22 states. [2018-11-28 13:09:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:53,507 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-28 13:09:53,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 13:09:53,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 212 transitions. [2018-11-28 13:09:53,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:53,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 183 states and 208 transitions. [2018-11-28 13:09:53,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:09:53,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:09:53,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 208 transitions. [2018-11-28 13:09:53,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:53,510 INFO L705 BuchiCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-11-28 13:09:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 208 transitions. [2018-11-28 13:09:53,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2018-11-28 13:09:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-28 13:09:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 206 transitions. [2018-11-28 13:09:53,513 INFO L728 BuchiCegarLoop]: Abstraction has 181 states and 206 transitions. [2018-11-28 13:09:53,513 INFO L608 BuchiCegarLoop]: Abstraction has 181 states and 206 transitions. [2018-11-28 13:09:53,513 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-28 13:09:53,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 206 transitions. [2018-11-28 13:09:53,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:53,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:53,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:53,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 36, 31, 5, 1] [2018-11-28 13:09:53,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:53,517 INFO L794 eck$LassoCheckResult]: Stem: 6050#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 6051#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6066#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6059#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6053#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6229#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6227#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6226#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6225#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6224#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6223#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6222#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6221#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6220#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6219#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6218#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6217#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6216#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6214#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6213#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6212#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6211#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6210#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6209#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6208#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6207#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6206#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6205#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6204#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6203#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6202#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6201#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6200#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6199#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6198#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6197#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6196#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6195#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6194#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6193#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6192#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6191#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6190#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6189#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6188#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6187#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6186#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6185#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6184#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6183#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6182#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6181#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6180#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6178#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6177#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6176#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6175#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6174#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6173#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6172#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6171#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6170#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6169#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6168#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6167#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6166#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6165#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6164#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6163#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6161#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6159#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6156#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6153#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6150#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6144#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6138#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6135#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6128#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6126#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6127#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6124#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6123#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6090#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6089#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6086#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6085#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6077#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6084#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6081#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6080#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6079#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6076#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6072#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6070#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6064#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6063#L12 [2018-11-28 13:09:53,517 INFO L796 eck$LassoCheckResult]: Loop: 6063#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 6062#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6063#L12 [2018-11-28 13:09:53,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1939361448, now seen corresponding path program 21 times [2018-11-28 13:09:53,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:53,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:53,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:53,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:53,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 496 proven. 825 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-11-28 13:09:53,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:53,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:53,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:09:53,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-28 13:09:53,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:53,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 825 proven. 91 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2018-11-28 13:09:53,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:53,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 24 [2018-11-28 13:09:53,781 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:53,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 17 times [2018-11-28 13:09:53,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:53,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:53,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 13:09:53,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:09:53,791 INFO L87 Difference]: Start difference. First operand 181 states and 206 transitions. cyclomatic complexity: 29 Second operand 24 states. [2018-11-28 13:09:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:54,310 INFO L93 Difference]: Finished difference Result 226 states and 255 transitions. [2018-11-28 13:09:54,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-28 13:09:54,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 255 transitions. [2018-11-28 13:09:54,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:54,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 220 states and 249 transitions. [2018-11-28 13:09:54,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 13:09:54,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 13:09:54,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 249 transitions. [2018-11-28 13:09:54,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:54,313 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-11-28 13:09:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 249 transitions. [2018-11-28 13:09:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 142. [2018-11-28 13:09:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-28 13:09:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-11-28 13:09:54,324 INFO L728 BuchiCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-11-28 13:09:54,324 INFO L608 BuchiCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-11-28 13:09:54,324 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-28 13:09:54,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 152 transitions. [2018-11-28 13:09:54,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:54,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:54,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:54,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [43, 42, 36, 6, 1] [2018-11-28 13:09:54,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:54,326 INFO L794 eck$LassoCheckResult]: Stem: 6883#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 6884#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6896#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6892#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6894#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6895#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6886#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7023#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7022#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7016#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7015#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7014#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7011#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7010#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7009#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7008#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7007#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7006#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7005#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7004#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7003#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7002#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7001#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7000#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6999#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6998#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6997#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6996#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6995#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6994#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6993#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6992#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6991#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6990#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6989#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6988#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6987#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6986#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6985#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6984#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6983#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6982#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6981#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6980#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6979#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6978#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6975#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6974#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6972#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6973#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6970#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6969#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6968#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6967#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6966#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6965#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6964#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6963#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6961#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6960#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6959#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6956#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6955#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6953#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6949#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6947#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6946#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6945#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6942#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6940#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6939#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6923#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6937#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6934#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6933#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6932#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6931#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6930#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6929#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6928#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6927#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6926#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6925#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6914#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6922#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6921#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6920#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6919#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6918#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6917#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6916#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6909#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6915#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6913#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6912#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6911#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6910#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6908#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6905#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6906#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6903#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6902#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6900#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6898#L12 [2018-11-28 13:09:54,326 INFO L796 eck$LassoCheckResult]: Loop: 6898#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 6899#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6898#L12 [2018-11-28 13:09:54,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash 444686790, now seen corresponding path program 22 times [2018-11-28 13:09:54,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:54,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:54,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 924 proven. 1014 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2018-11-28 13:09:54,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:54,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:54,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 13:09:54,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 13:09:54,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:54,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1497 proven. 1009 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-28 13:09:54,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:54,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 34] total 50 [2018-11-28 13:09:54,959 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:54,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 18 times [2018-11-28 13:09:54,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:54,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:54,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-28 13:09:54,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=1930, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 13:09:54,970 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. cyclomatic complexity: 14 Second operand 50 states. [2018-11-28 13:09:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:57,078 INFO L93 Difference]: Finished difference Result 665 states and 712 transitions. [2018-11-28 13:09:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-11-28 13:09:57,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 665 states and 712 transitions. [2018-11-28 13:09:57,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:57,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 665 states to 569 states and 616 transitions. [2018-11-28 13:09:57,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 13:09:57,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 13:09:57,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 569 states and 616 transitions. [2018-11-28 13:09:57,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:57,082 INFO L705 BuchiCegarLoop]: Abstraction has 569 states and 616 transitions. [2018-11-28 13:09:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states and 616 transitions. [2018-11-28 13:09:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 409. [2018-11-28 13:09:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-11-28 13:09:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 433 transitions. [2018-11-28 13:09:57,088 INFO L728 BuchiCegarLoop]: Abstraction has 409 states and 433 transitions. [2018-11-28 13:09:57,088 INFO L608 BuchiCegarLoop]: Abstraction has 409 states and 433 transitions. [2018-11-28 13:09:57,088 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-28 13:09:57,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 409 states and 433 transitions. [2018-11-28 13:09:57,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:57,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:57,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:57,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [67, 66, 58, 8, 1] [2018-11-28 13:09:57,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:57,091 INFO L794 eck$LassoCheckResult]: Stem: 8528#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 8529#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8541#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8537#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8540#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8530#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8531#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8932#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8931#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8930#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8929#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8928#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8927#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8926#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8925#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8924#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8923#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8922#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8921#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8920#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8919#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8918#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8917#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8916#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8915#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8914#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8913#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8912#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8911#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8910#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8909#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8908#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8907#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8906#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8905#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8904#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8903#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8901#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8900#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8899#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8898#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8897#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8896#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8895#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8894#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8893#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8892#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8891#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8890#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8889#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8888#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8887#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8886#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8885#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8884#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8883#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8881#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8882#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8880#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8879#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8878#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8877#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8876#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8875#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8874#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8872#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8870#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8869#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8868#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8867#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8866#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8865#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8864#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8863#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8862#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8861#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8860#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8859#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8858#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8857#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8856#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8855#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8854#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8853#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8852#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8851#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8850#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8849#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8848#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8847#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8846#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8845#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8844#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8843#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8841#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8803#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8840#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8839#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8838#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8740#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8739#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8738#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8737#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8736#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8735#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8734#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8733#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8732#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8731#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8730#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8729#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8728#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8727#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8726#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8725#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8724#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8723#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8722#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8721#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8720#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8719#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8718#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8717#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8716#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8715#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8714#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8713#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8712#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8711#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8710#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8709#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8708#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8707#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8705#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8680#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8681#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8654#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8628#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8626#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8624#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8625#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8679#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8678#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8676#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8675#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8674#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8673#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8672#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8670#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8669#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8668#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8667#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8666#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8665#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8664#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8663#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8662#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8661#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8659#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8655#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8632#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8630#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8576#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8575#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8574#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8573#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8571#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8570#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8569#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8568#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8566#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8565#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8564#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8563#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8562#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8561#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8559#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8557#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8556#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8555#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8554#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8552#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8549#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8550#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8547#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8546#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8544#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8542#L12 [2018-11-28 13:09:57,091 INFO L796 eck$LassoCheckResult]: Loop: 8542#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 8543#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8542#L12 [2018-11-28 13:09:57,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash -243589438, now seen corresponding path program 23 times [2018-11-28 13:09:57,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:57,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:57,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:57,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:57,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2782 proven. 154 refuted. 0 times theorem prover too weak. 3565 trivial. 0 not checked. [2018-11-28 13:09:57,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:57,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:57,222 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 13:09:57,275 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2018-11-28 13:09:57,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:57,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 4579 proven. 815 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-11-28 13:09:57,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:57,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 30] total 45 [2018-11-28 13:09:57,630 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:57,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:57,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 19 times [2018-11-28 13:09:57,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:57,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:57,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:57,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:57,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:57,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-28 13:09:57,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1564, Unknown=0, NotChecked=0, Total=1980 [2018-11-28 13:09:57,645 INFO L87 Difference]: Start difference. First operand 409 states and 433 transitions. cyclomatic complexity: 28 Second operand 45 states. [2018-11-28 13:09:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:58,781 INFO L93 Difference]: Finished difference Result 618 states and 652 transitions. [2018-11-28 13:09:58,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-28 13:09:58,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 618 states and 652 transitions. [2018-11-28 13:09:58,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:58,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 618 states to 565 states and 598 transitions. [2018-11-28 13:09:58,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 13:09:58,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 13:09:58,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 565 states and 598 transitions. [2018-11-28 13:09:58,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:58,786 INFO L705 BuchiCegarLoop]: Abstraction has 565 states and 598 transitions. [2018-11-28 13:09:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states and 598 transitions. [2018-11-28 13:09:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 426. [2018-11-28 13:09:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-11-28 13:09:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 453 transitions. [2018-11-28 13:09:58,791 INFO L728 BuchiCegarLoop]: Abstraction has 426 states and 453 transitions. [2018-11-28 13:09:58,792 INFO L608 BuchiCegarLoop]: Abstraction has 426 states and 453 transitions. [2018-11-28 13:09:58,792 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-28 13:09:58,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 426 states and 453 transitions. [2018-11-28 13:09:58,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:58,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:58,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:58,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [81, 80, 70, 10, 1] [2018-11-28 13:09:58,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:58,794 INFO L794 eck$LassoCheckResult]: Stem: 10313#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 10314#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10328#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10323#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10324#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10326#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10315#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10316#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10682#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10681#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10680#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10679#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10678#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10676#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10675#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10674#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10673#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10672#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10670#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10669#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10668#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10667#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10666#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10665#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10664#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10663#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10662#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10661#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10660#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10659#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10658#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10657#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10656#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10655#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10654#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10653#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10652#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10651#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10650#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10649#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10648#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10647#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10646#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10645#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10644#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10643#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10642#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10641#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10640#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10639#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10638#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10637#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10636#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10635#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10634#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10633#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10631#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10632#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10630#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10629#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10628#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10627#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10626#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10625#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10624#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10623#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10622#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10621#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10620#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10619#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10618#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10617#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10616#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10615#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10614#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10613#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10612#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10611#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10610#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10609#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10608#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10607#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10606#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10605#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10604#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10603#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10602#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10601#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10600#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10599#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10598#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10597#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10596#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10595#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10594#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10593#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10592#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10591#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10590#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10589#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10588#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10584#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10587#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10585#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10582#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10580#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10576#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10574#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10568#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10566#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10564#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10562#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10556#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10554#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10552#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10550#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10548#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10546#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10544#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10542#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10538#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10536#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10534#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10532#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10530#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10528#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10526#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10524#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10522#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10520#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10518#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10516#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10515#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10512#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10513#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10705#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10478#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10476#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10473#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10471#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10469#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10467#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10464#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10462#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10460#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10458#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10456#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10454#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10452#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10450#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10448#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10446#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10444#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10442#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10440#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10438#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10436#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10434#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10432#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10430#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10428#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10426#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10424#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10422#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10420#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10418#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10416#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10415#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10413#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10404#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10396#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10395#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10394#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10393#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10392#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10391#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10390#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10389#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10388#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10387#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10386#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10385#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10384#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10383#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10382#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10381#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10379#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10378#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10377#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10376#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10375#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10374#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10373#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10372#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10371#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10370#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10369#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10368#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10367#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10366#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10364#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10363#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10362#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10361#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10360#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10359#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10358#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10357#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10356#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10355#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10354#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10350#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10349#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10348#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10336#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10345#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10343#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10342#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10340#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10339#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10338#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10337#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10335#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10334#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10333#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10331#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10329#L12 [2018-11-28 13:09:58,795 INFO L796 eck$LassoCheckResult]: Loop: 10329#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 10330#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10329#L12 [2018-11-28 13:09:58,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1076149930, now seen corresponding path program 24 times [2018-11-28 13:09:58,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:58,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:58,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:58,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:58,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 5192 proven. 254 refuted. 0 times theorem prover too weak. 4114 trivial. 0 not checked. [2018-11-28 13:09:58,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:58,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:09:58,987 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 13:09:59,027 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-11-28 13:09:59,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:59,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 4788 proven. 1320 refuted. 0 times theorem prover too weak. 3452 trivial. 0 not checked. [2018-11-28 13:09:59,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:59,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2018-11-28 13:09:59,228 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:59,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:59,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 20 times [2018-11-28 13:09:59,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:59,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:59,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:59,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:59,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:59,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 13:09:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=977, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 13:09:59,240 INFO L87 Difference]: Start difference. First operand 426 states and 453 transitions. cyclomatic complexity: 32 Second operand 37 states. [2018-11-28 13:10:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:00,113 INFO L93 Difference]: Finished difference Result 513 states and 546 transitions. [2018-11-28 13:10:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-28 13:10:00,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 546 transitions. [2018-11-28 13:10:00,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:00,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 503 states and 536 transitions. [2018-11-28 13:10:00,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 13:10:00,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 13:10:00,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 503 states and 536 transitions. [2018-11-28 13:10:00,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:10:00,116 INFO L705 BuchiCegarLoop]: Abstraction has 503 states and 536 transitions. [2018-11-28 13:10:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states and 536 transitions. [2018-11-28 13:10:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 438. [2018-11-28 13:10:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-11-28 13:10:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 465 transitions. [2018-11-28 13:10:00,122 INFO L728 BuchiCegarLoop]: Abstraction has 438 states and 465 transitions. [2018-11-28 13:10:00,122 INFO L608 BuchiCegarLoop]: Abstraction has 438 states and 465 transitions. [2018-11-28 13:10:00,122 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-28 13:10:00,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 438 states and 465 transitions. [2018-11-28 13:10:00,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:00,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:10:00,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:10:00,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [90, 89, 78, 11, 1] [2018-11-28 13:10:00,125 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:10:00,125 INFO L794 eck$LassoCheckResult]: Stem: 12151#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 12152#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12165#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12160#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12161#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12162#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12163#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12153#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12154#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12587#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12586#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12585#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12584#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12583#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12582#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12581#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12580#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12579#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12578#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12577#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12576#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12575#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12574#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12573#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12572#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12571#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12569#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12568#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12567#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12566#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12565#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12564#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12561#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12560#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12559#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12557#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12556#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12555#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12554#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12553#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12552#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12551#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12550#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12549#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12548#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12547#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12546#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12545#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12544#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12543#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12542#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12539#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12536#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12537#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12535#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12534#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12533#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12532#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12531#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12530#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12529#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12528#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12527#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12526#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12525#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12524#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12523#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12522#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12521#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12520#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12519#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12518#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12517#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12516#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12515#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12514#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12513#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12512#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12511#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12510#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12509#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12508#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12507#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12506#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12505#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12504#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12503#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12502#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12501#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12500#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12499#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12498#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12497#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12496#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12495#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12494#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12493#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12492#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12491#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12490#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12489#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12488#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12487#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12486#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12485#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12484#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12483#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12482#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12481#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12307#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12400#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12399#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12395#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12393#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12391#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12389#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12387#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12385#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12383#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12379#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12377#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12373#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12371#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12367#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12365#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12361#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12359#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12357#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12355#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12353#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12351#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12349#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12343#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12340#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12338#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12336#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12334#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12333#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12332#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12331#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12329#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12328#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12327#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12326#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12324#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12322#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12323#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12480#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12479#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12478#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12477#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12476#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12475#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12474#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12473#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12472#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12471#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12470#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12469#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12468#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12467#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12466#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12465#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12464#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12463#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12462#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12260#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12235#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12258#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12254#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12253#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12252#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12251#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12250#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12249#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12248#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12247#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12246#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12245#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12244#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12243#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12242#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12241#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12240#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12239#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12238#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12237#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12217#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12236#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12234#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12233#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12232#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12231#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12230#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12229#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12227#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12226#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12225#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12224#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12223#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12222#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12221#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12220#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12219#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12202#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12218#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12216#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12214#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12213#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12212#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12211#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12210#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12209#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12208#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12207#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12206#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12205#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12204#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12190#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12203#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12201#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12200#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12199#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12198#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12197#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12196#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12195#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12194#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12193#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12192#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12181#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12191#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12189#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12188#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12187#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12186#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12185#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12184#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12183#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12173#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12180#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12179#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12177#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12176#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12175#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12174#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12172#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12171#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12170#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12168#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12166#L12 [2018-11-28 13:10:00,125 INFO L796 eck$LassoCheckResult]: Loop: 12166#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 12167#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12166#L12 [2018-11-28 13:10:00,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:00,126 INFO L82 PathProgramCache]: Analyzing trace with hash 224441309, now seen corresponding path program 25 times [2018-11-28 13:10:00,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:00,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:00,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:00,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:00,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 7913 proven. 502 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-11-28 13:10:00,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:00,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:10:00,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:00,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 5724 proven. 3210 refuted. 0 times theorem prover too weak. 2903 trivial. 0 not checked. [2018-11-28 13:10:00,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:00,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 44 [2018-11-28 13:10:00,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:10:00,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 21 times [2018-11-28 13:10:00,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:00,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:00,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:00,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:00,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:00,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-28 13:10:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1472, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 13:10:00,780 INFO L87 Difference]: Start difference. First operand 438 states and 465 transitions. cyclomatic complexity: 32 Second operand 44 states. [2018-11-28 13:10:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:02,187 INFO L93 Difference]: Finished difference Result 676 states and 715 transitions. [2018-11-28 13:10:02,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-11-28 13:10:02,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 676 states and 715 transitions. [2018-11-28 13:10:02,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:02,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 676 states to 660 states and 698 transitions. [2018-11-28 13:10:02,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 13:10:02,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 13:10:02,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 698 transitions. [2018-11-28 13:10:02,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:10:02,191 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 698 transitions. [2018-11-28 13:10:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 698 transitions. [2018-11-28 13:10:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 510. [2018-11-28 13:10:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-11-28 13:10:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 537 transitions. [2018-11-28 13:10:02,197 INFO L728 BuchiCegarLoop]: Abstraction has 510 states and 537 transitions. [2018-11-28 13:10:02,197 INFO L608 BuchiCegarLoop]: Abstraction has 510 states and 537 transitions. [2018-11-28 13:10:02,197 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-28 13:10:02,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 510 states and 537 transitions. [2018-11-28 13:10:02,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:02,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:10:02,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:10:02,200 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [94, 93, 82, 11, 1] [2018-11-28 13:10:02,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:10:02,201 INFO L794 eck$LassoCheckResult]: Stem: 14332#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 14333#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14345#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14341#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14342#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14343#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14344#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14335#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14831#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14830#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14829#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14828#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14827#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14826#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14825#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14824#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14823#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14822#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14821#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14820#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14819#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14818#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14817#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14816#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14815#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14814#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14813#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14812#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14811#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14810#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14809#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14808#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14807#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14806#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14805#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14804#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14803#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14802#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14801#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14800#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14799#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14798#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14797#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14796#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14795#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14794#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14793#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14792#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14791#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14790#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14789#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14788#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14787#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14786#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14785#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14784#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14783#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14782#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14780#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14781#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14779#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14778#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14777#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14776#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14775#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14774#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14773#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14772#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14771#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14770#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14769#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14768#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14767#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14766#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14765#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14764#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14763#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14762#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14761#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14760#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14759#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14758#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14757#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14756#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14755#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14754#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14753#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14752#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14751#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14750#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14749#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14748#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14747#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14746#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14744#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14743#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14742#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14741#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14740#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14738#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14737#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14736#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14735#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14734#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14732#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14731#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14730#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14729#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14728#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14727#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14726#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14722#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14724#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14721#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14719#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14717#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14715#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14713#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14711#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14709#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14707#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14705#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14703#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14701#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14699#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14697#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14695#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14693#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14691#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14689#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14687#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14685#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14683#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14681#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14679#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14675#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14673#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14669#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14667#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14665#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14663#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14661#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14659#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14657#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14655#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14653#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14651#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14649#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14593#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14588#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14587#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14582#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14841#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14540#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14840#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14839#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14838#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14837#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14836#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14641#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14639#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14637#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14635#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14633#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14631#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14629#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14627#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14625#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14623#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14621#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14619#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14617#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14615#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14613#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14611#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14609#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14594#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14589#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14442#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14443#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14434#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14433#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14431#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14430#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14429#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14428#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14427#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14426#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14425#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14424#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14423#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14422#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14421#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14420#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14419#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14418#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14417#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14416#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14414#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14413#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14412#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14411#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14410#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14409#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14408#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14407#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14406#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14405#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14404#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14403#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14402#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14401#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14400#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14399#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14382#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14398#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14396#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14395#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14394#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14393#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14392#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14391#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14390#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14389#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14388#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14387#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14386#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14385#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14370#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14383#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14380#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14379#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14378#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14377#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14376#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14373#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14372#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14361#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14371#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14368#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14367#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14366#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14364#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14362#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14360#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14359#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14357#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14356#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14355#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14354#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14350#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14348#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14346#L12 [2018-11-28 13:10:02,201 INFO L796 eck$LassoCheckResult]: Loop: 14346#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 14347#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14346#L12 [2018-11-28 13:10:02,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:02,201 INFO L82 PathProgramCache]: Analyzing trace with hash -120037987, now seen corresponding path program 26 times [2018-11-28 13:10:02,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:02,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:02,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:02,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:02,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 7388 proven. 327 refuted. 0 times theorem prover too weak. 5212 trivial. 0 not checked. [2018-11-28 13:10:02,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:02,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:10:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:10:02,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:10:02,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:02,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 6272 proven. 3537 refuted. 0 times theorem prover too weak. 3118 trivial. 0 not checked. [2018-11-28 13:10:02,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:02,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2018-11-28 13:10:02,738 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:10:02,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:02,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 22 times [2018-11-28 13:10:02,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:02,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:02,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:02,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:02,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:02,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-28 13:10:02,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=1231, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 13:10:02,752 INFO L87 Difference]: Start difference. First operand 510 states and 537 transitions. cyclomatic complexity: 33 Second operand 41 states. [2018-11-28 13:10:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:04,009 INFO L93 Difference]: Finished difference Result 599 states and 633 transitions. [2018-11-28 13:10:04,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-11-28 13:10:04,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 599 states and 633 transitions. [2018-11-28 13:10:04,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:04,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 599 states to 593 states and 627 transitions. [2018-11-28 13:10:04,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 13:10:04,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 13:10:04,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 627 transitions. [2018-11-28 13:10:04,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:10:04,013 INFO L705 BuchiCegarLoop]: Abstraction has 593 states and 627 transitions. [2018-11-28 13:10:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 627 transitions. [2018-11-28 13:10:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 516. [2018-11-28 13:10:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-11-28 13:10:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 543 transitions. [2018-11-28 13:10:04,016 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 543 transitions. [2018-11-28 13:10:04,016 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 543 transitions. [2018-11-28 13:10:04,016 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-28 13:10:04,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 543 transitions. [2018-11-28 13:10:04,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:04,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:10:04,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:10:04,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [115, 114, 101, 13, 1] [2018-11-28 13:10:04,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:10:04,019 INFO L794 eck$LassoCheckResult]: Stem: 16513#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 16514#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16526#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16522#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16523#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16524#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16525#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16515#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16516#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17024#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17023#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17022#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17021#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17020#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17019#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17018#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17017#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17016#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17015#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17014#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17013#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17012#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17011#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17010#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17009#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17008#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17007#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17006#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17005#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17004#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17003#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17002#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17001#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17000#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16999#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16998#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16997#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16996#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16995#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16994#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16993#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16992#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16991#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16990#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16989#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16988#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16987#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16986#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16984#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16982#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16981#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16980#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16979#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16978#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16977#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16976#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16975#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16974#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16972#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16971#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16970#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16969#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16968#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16967#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16966#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16965#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16964#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16963#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16962#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16961#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16960#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16959#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16958#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16957#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16956#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16955#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16954#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16953#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16952#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16951#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16950#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16949#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16948#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16947#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16946#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16945#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16944#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16943#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16942#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16941#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16940#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16939#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16938#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16937#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16936#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16935#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16934#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16933#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16932#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16931#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16930#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16929#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16928#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16927#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16926#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16925#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16924#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16923#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16922#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16921#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16920#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16919#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16918#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16917#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16915#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16914#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16913#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16912#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16911#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16910#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16909#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16908#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16907#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16906#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16905#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16904#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16903#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16902#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16901#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16900#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16899#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16898#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16897#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16896#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16895#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16894#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16893#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16892#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16891#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16890#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16889#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16888#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16887#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16886#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16884#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16883#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16882#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16881#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16880#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16879#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16878#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16877#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16876#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16875#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16874#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16873#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16872#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16871#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16870#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16869#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16868#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16867#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16866#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16865#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16864#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16709#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16766#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16764#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16763#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16762#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16761#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16760#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16759#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16758#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16757#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16756#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16755#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16754#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16753#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16752#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16751#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16750#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16749#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16748#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16747#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16746#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16744#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16743#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16742#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16741#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16740#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16738#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16737#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16736#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16735#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16734#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16732#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16731#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16641#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16724#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16701#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16699#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16697#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16695#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16693#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16691#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16689#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16687#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16685#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16683#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16681#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16679#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16675#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16673#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16669#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16667#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16665#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16663#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16661#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16659#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16657#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16655#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16617#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16652#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16645#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16639#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16638#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16637#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16636#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16635#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16634#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16633#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16632#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16631#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16630#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16629#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16628#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16627#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16626#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16625#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16624#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16623#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16622#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16621#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16620#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16619#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16596#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16618#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16616#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16615#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16614#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16613#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16612#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16611#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16610#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16609#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16608#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16607#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16606#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16605#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16604#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16603#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16602#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16601#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16600#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16599#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16598#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16578#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16595#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16594#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16593#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16592#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16591#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16590#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16589#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16588#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16587#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16586#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16585#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16584#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16583#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16582#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16581#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16580#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16563#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16579#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16577#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16576#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16575#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16574#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16573#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16572#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16571#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16569#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16568#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16567#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16566#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16565#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16551#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16564#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16561#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16560#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16559#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16557#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16556#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16555#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16554#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16553#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16542#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16552#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16550#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16549#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16548#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16547#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16546#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16545#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16544#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16534#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16543#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16538#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16537#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16536#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16535#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16533#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16532#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16531#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16529#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16527#L12 [2018-11-28 13:10:04,019 INFO L796 eck$LassoCheckResult]: Loop: 16527#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 16528#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16527#L12 [2018-11-28 13:10:04,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:04,019 INFO L82 PathProgramCache]: Analyzing trace with hash 243369228, now seen corresponding path program 27 times [2018-11-28 13:10:04,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:04,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:04,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:04,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:04,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 19437 backedges. 12156 proven. 500 refuted. 0 times theorem prover too weak. 6781 trivial. 0 not checked. [2018-11-28 13:10:04,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:04,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/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-28 13:10:04,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:10:04,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-11-28 13:10:04,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:04,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 19437 backedges. 9999 proven. 3889 refuted. 0 times theorem prover too weak. 5549 trivial. 0 not checked. [2018-11-28 13:10:04,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:04,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 35 [2018-11-28 13:10:04,765 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:10:04,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 23 times [2018-11-28 13:10:04,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:04,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:04,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:04,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:04,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:04,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 13:10:04,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 13:10:04,788 INFO L87 Difference]: Start difference. First operand 516 states and 543 transitions. cyclomatic complexity: 33 Second operand 35 states. [2018-11-28 13:10:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:05,907 INFO L93 Difference]: Finished difference Result 644 states and 687 transitions. [2018-11-28 13:10:05,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-11-28 13:10:05,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 644 states and 687 transitions. [2018-11-28 13:10:05,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:05,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 644 states to 638 states and 681 transitions. [2018-11-28 13:10:05,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 13:10:05,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 13:10:05,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 638 states and 681 transitions. [2018-11-28 13:10:05,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:10:05,910 INFO L705 BuchiCegarLoop]: Abstraction has 638 states and 681 transitions. [2018-11-28 13:10:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states and 681 transitions. [2018-11-28 13:10:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 516. [2018-11-28 13:10:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-11-28 13:10:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 543 transitions. [2018-11-28 13:10:05,914 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 543 transitions. [2018-11-28 13:10:05,914 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 543 transitions. [2018-11-28 13:10:05,914 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-28 13:10:05,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 543 transitions. [2018-11-28 13:10:05,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:05,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:10:05,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:10:05,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [125, 124, 110, 14, 1] [2018-11-28 13:10:05,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:10:05,917 INFO L794 eck$LassoCheckResult]: Stem: 18880#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 18881#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18893#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18889#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18890#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18891#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18892#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18882#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18883#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19391#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19390#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19389#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19388#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19387#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19386#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19385#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19383#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19382#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19380#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19379#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19378#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19377#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19376#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19373#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19372#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19371#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19370#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19368#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19367#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19366#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19364#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19361#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19360#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19359#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19358#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19357#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19356#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19355#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19354#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19352#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19351#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19350#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19349#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19348#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19347#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19346#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19343#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19342#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19340#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19341#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19339#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19338#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19337#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19336#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19335#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19334#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19333#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19332#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19331#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19330#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19329#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19328#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19327#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19326#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19325#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19324#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19323#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19322#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19321#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19320#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19319#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19318#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19317#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19316#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19315#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19314#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19313#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19312#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19311#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19310#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19309#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19308#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19307#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19306#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19305#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19304#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19303#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19302#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19301#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19300#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19299#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19298#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19297#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19296#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19295#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19294#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19293#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19292#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19291#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19290#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19289#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19288#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19287#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19286#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19285#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19283#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19284#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19282#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19281#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19280#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19279#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19278#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19277#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19276#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19275#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19274#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19273#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19272#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19271#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19270#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19269#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19268#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19267#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19266#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19265#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19264#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19263#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19262#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19261#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19260#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19259#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19258#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19257#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19256#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19255#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19254#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19253#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19252#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19251#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19250#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19248#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19246#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19244#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19242#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19240#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19238#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19236#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19234#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19232#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19230#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19228#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19226#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19224#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19222#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19220#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19218#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19216#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19214#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19198#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19196#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19194#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19191#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19249#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19247#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19245#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19243#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19241#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19239#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19237#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19235#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19233#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19231#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19229#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19227#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19225#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19223#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19221#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19219#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19217#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19213#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19212#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19211#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19210#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19208#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19206#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19137#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19134#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19128#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19125#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19119#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19070#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19066#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19067#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19064#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19063#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19062#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19061#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19060#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19059#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19058#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19057#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19056#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19055#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19054#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19053#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19051#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19050#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19049#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19048#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19047#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19046#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19045#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19044#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19043#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19042#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19041#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19040#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19039#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19038#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19008#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19036#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19032#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19027#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19026#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19025#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19024#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19023#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19022#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19016#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19015#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19014#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19011#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19010#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18984#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19009#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19007#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19006#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19005#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19004#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19003#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19002#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19001#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19000#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18999#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18998#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18997#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18996#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18995#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18994#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18993#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18992#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18991#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18990#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18989#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18988#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18987#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18986#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18963#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18983#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18982#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18981#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18980#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18979#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18978#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18975#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18974#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18972#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18970#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18969#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18968#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18967#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18966#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18965#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18945#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18964#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18961#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18960#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18959#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18956#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18955#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18953#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18949#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18947#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18930#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18946#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18942#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18940#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18939#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18937#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18936#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18935#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18934#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18933#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18918#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18931#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18929#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18928#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18927#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18923#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18922#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18921#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18920#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18909#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18919#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18915#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18913#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18912#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18901#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18910#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18908#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18907#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18905#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18904#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18903#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18900#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18899#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18898#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18896#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18894#L12 [2018-11-28 13:10:05,918 INFO L796 eck$LassoCheckResult]: Loop: 18894#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 18895#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18894#L12 [2018-11-28 13:10:05,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1681703982, now seen corresponding path program 28 times [2018-11-28 13:10:05,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:05,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:05,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 23002 backedges. 14587 proven. 574 refuted. 0 times theorem prover too weak. 7841 trivial. 0 not checked. [2018-11-28 13:10:06,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:06,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:10:06,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 13:10:06,278 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 13:10:06,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:06,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 23002 backedges. 12094 proven. 5587 refuted. 0 times theorem prover too weak. 5321 trivial. 0 not checked. [2018-11-28 13:10:06,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 36] total 52 [2018-11-28 13:10:06,659 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:10:06,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 24 times [2018-11-28 13:10:06,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:06,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:06,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:06,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-28 13:10:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=2106, Unknown=0, NotChecked=0, Total=2652 [2018-11-28 13:10:06,686 INFO L87 Difference]: Start difference. First operand 516 states and 543 transitions. cyclomatic complexity: 33 Second operand 52 states. [2018-11-28 13:10:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:09,273 INFO L93 Difference]: Finished difference Result 780 states and 825 transitions. [2018-11-28 13:10:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-11-28 13:10:09,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 780 states and 825 transitions. [2018-11-28 13:10:09,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:09,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 780 states to 744 states and 786 transitions. [2018-11-28 13:10:09,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 13:10:09,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 13:10:09,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 786 transitions. [2018-11-28 13:10:09,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:10:09,278 INFO L705 BuchiCegarLoop]: Abstraction has 744 states and 786 transitions. [2018-11-28 13:10:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 786 transitions. [2018-11-28 13:10:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 565. [2018-11-28 13:10:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-11-28 13:10:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 588 transitions. [2018-11-28 13:10:09,284 INFO L728 BuchiCegarLoop]: Abstraction has 565 states and 588 transitions. [2018-11-28 13:10:09,284 INFO L608 BuchiCegarLoop]: Abstraction has 565 states and 588 transitions. [2018-11-28 13:10:09,284 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-28 13:10:09,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 565 states and 588 transitions. [2018-11-28 13:10:09,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:09,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:10:09,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:10:09,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [169, 168, 151, 17, 1] [2018-11-28 13:10:09,288 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:10:09,288 INFO L794 eck$LassoCheckResult]: Stem: 21637#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 21638#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21650#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21646#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21647#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21648#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21649#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21639#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21640#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22197#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22196#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22195#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22194#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22191#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22190#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22189#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22188#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22186#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22185#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22181#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22180#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22178#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22177#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22176#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22175#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22174#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22173#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22172#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22171#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22170#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22169#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22168#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22167#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22166#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22165#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22164#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22163#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22162#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22161#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22160#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22159#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22158#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22157#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22156#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22155#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22154#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22153#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22152#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22151#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22150#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22149#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22148#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22146#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22143#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 22142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22132#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22129#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22123#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22121#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22119#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22106#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22101#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22099#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22098#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22097#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22095#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22093#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22092#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22031#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22090#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22089#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22088#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22087#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 22086#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22085#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22084#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22083#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22082#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22081#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22080#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22079#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22078#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22077#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22076#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22075#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22074#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22073#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22072#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22071#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22070#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22069#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22068#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22066#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22065#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22064#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22063#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22062#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22061#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22060#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22059#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22058#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22057#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22056#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22055#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22054#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22053#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22051#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22050#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22049#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22048#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22047#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22046#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22045#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22044#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22043#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22042#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22041#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22040#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22039#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22038#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22032#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22030#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22029#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22028#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 22027#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22026#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22025#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22024#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22023#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22022#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22021#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22020#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22019#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22018#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22017#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22016#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22015#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22014#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22013#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22012#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22011#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22010#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22009#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22008#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22007#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22006#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22005#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22004#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22003#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 22002#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 22001#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 22000#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21999#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21998#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21997#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21996#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21995#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21994#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21993#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21992#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21991#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21990#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21989#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21988#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21986#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21984#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21983#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21981#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21979#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21974#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21972#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21971#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21970#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21969#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21968#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21967#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21966#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21965#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21964#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21963#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21962#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21961#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21960#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21959#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21958#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21957#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21956#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21955#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21954#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21953#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21952#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21951#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21950#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21949#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21948#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21947#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21946#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21945#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21944#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21943#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21942#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21941#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21940#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21939#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21938#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21937#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21936#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21935#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21934#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21933#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21932#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21931#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21930#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21929#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21928#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21927#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21924#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21925#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21975#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21978#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21917#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21918#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21913#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21914#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21909#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21905#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21906#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21901#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21897#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21898#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21893#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21894#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21889#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21890#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21886#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21881#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21882#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21877#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21878#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21873#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21874#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21869#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21870#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21865#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21866#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21861#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21857#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21858#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21987#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21852#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21851#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21850#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21849#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21848#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21847#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21846#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21845#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21844#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21843#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21842#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21841#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21840#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21839#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21838#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21837#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21836#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21835#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21834#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21833#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21832#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21831#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21830#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21829#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21828#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21827#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21826#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21825#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21824#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21823#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21822#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21790#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21821#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21819#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21818#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21817#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21816#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21815#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21814#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21813#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21812#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21811#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21810#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21809#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21808#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21807#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21806#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21805#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21804#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21803#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21802#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21801#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21800#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21799#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21798#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21797#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21796#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21795#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21793#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21792#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21763#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21791#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21789#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21788#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21787#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21786#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21785#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21784#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21783#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21782#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21781#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21780#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21779#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21778#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21777#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21776#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21775#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21774#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21773#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21772#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21771#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21770#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21769#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21768#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21767#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21766#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21765#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21764#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21762#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21761#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21760#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21759#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21758#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21757#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21756#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21755#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21754#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21753#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21752#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21751#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21750#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21749#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21748#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21747#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21746#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21745#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21744#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21743#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21742#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21741#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21740#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21738#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21737#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21736#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21735#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21734#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21733#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21732#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21731#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21730#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21729#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21728#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21727#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21726#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21725#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21724#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21723#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21722#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21721#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21720#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21700#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21719#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21717#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21716#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21715#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21714#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21713#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21712#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21711#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21710#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21709#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21708#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21707#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21706#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21705#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21704#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21703#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21702#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21685#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21701#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21699#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21698#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21697#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21696#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21695#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21694#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21693#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21692#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21691#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21690#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21689#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21688#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21687#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21673#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21686#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21684#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21683#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21682#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21681#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21680#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21679#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21678#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21676#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21675#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21664#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21674#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21672#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21670#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21669#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21668#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21667#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21666#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21658#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21665#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21663#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21662#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21661#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21660#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21654#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21659#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21657#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21656#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21655#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21653#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21651#L12 [2018-11-28 13:10:09,289 INFO L796 eck$LassoCheckResult]: Loop: 21651#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 21652#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21651#L12 [2018-11-28 13:10:09,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1299310952, now seen corresponding path program 29 times [2018-11-28 13:10:09,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:09,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:09,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:09,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:09,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 42252 backedges. 26750 proven. 870 refuted. 0 times theorem prover too weak. 14632 trivial. 0 not checked. [2018-11-28 13:10:09,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:09,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:10:09,721 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 13:10:09,816 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 71 check-sat command(s) [2018-11-28 13:10:09,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:09,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 42252 backedges. 28394 proven. 2234 refuted. 0 times theorem prover too weak. 11624 trivial. 0 not checked. [2018-11-28 13:10:10,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:10,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2018-11-28 13:10:10,095 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:10:10,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:10,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 25 times [2018-11-28 13:10:10,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:10,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:10,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:10,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-28 13:10:10,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2018-11-28 13:10:10,111 INFO L87 Difference]: Start difference. First operand 565 states and 588 transitions. cyclomatic complexity: 28 Second operand 49 states. [2018-11-28 13:10:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:12,158 INFO L93 Difference]: Finished difference Result 761 states and 799 transitions. [2018-11-28 13:10:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-11-28 13:10:12,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 761 states and 799 transitions. [2018-11-28 13:10:12,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:12,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 761 states to 749 states and 787 transitions. [2018-11-28 13:10:12,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 13:10:12,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 13:10:12,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 749 states and 787 transitions. [2018-11-28 13:10:12,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:10:12,161 INFO L705 BuchiCegarLoop]: Abstraction has 749 states and 787 transitions. [2018-11-28 13:10:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states and 787 transitions. [2018-11-28 13:10:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 643. [2018-11-28 13:10:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-11-28 13:10:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 664 transitions. [2018-11-28 13:10:12,168 INFO L728 BuchiCegarLoop]: Abstraction has 643 states and 664 transitions. [2018-11-28 13:10:12,168 INFO L608 BuchiCegarLoop]: Abstraction has 643 states and 664 transitions. [2018-11-28 13:10:12,168 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-28 13:10:12,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 643 states and 664 transitions. [2018-11-28 13:10:12,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:10:12,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:10:12,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:10:12,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [211, 210, 190, 20, 1] [2018-11-28 13:10:12,173 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:10:12,173 INFO L794 eck$LassoCheckResult]: Stem: 24810#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 24811#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24823#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24819#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24820#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24821#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24822#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24812#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24813#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25448#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25447#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25446#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25445#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25444#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25443#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25442#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25441#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25440#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25439#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25438#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25437#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25436#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25435#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25434#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25433#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25431#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25430#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25429#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25428#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25427#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25426#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25425#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25424#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25423#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25422#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25421#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25420#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25419#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25418#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25417#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25416#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25415#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25414#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25413#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25412#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25411#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25410#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25409#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25408#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25407#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25406#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25405#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25404#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25403#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25402#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25401#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25400#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25399#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25398#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25396#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25395#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25394#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25393#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25392#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25391#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25390#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25389#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25388#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25387#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25386#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25385#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25383#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25382#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25380#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25379#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25378#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25377#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25376#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25373#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25372#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25371#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25370#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25368#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25367#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25366#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25364#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25361#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25360#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25359#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25358#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25357#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25356#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25355#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25354#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25352#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25351#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25350#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25349#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25348#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25347#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25346#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25343#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25342#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25287#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25341#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25340#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25339#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25338#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25337#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25336#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25335#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25333#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25332#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25331#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25330#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25329#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25328#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25327#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25326#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25325#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25324#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25323#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25322#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25321#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25320#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25319#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25318#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25316#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25315#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25314#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25313#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25312#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25311#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25309#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25308#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25307#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25306#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25305#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25304#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25303#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25302#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25301#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25300#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25299#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25298#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25297#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25296#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25295#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25294#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25293#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25292#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25291#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25290#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25289#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25288#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25286#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25285#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25284#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25283#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25282#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25281#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25279#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25278#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25276#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25272#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25261#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25258#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25256#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25255#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25254#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25253#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25252#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25251#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25250#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25249#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25248#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25247#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25246#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25245#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25244#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25243#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25242#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25241#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25240#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25239#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25238#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25188#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25237#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25235#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25234#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25233#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25232#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25231#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25230#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25229#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25228#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25227#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25226#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25225#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25224#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25223#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25222#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25221#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25220#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25219#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25218#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25217#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25216#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25215#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25213#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25212#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25211#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25210#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25209#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25208#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25207#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25206#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25205#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25204#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25203#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25202#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25201#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25200#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25199#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25198#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25197#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25196#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25195#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25194#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25191#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25190#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25143#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25189#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25186#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25185#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25181#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25180#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25178#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25177#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25176#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25175#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25174#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25173#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25172#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25171#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25170#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25169#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25168#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25167#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25166#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25165#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25164#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25163#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25162#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25161#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25160#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25159#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25158#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25157#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25156#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25155#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25154#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25153#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25152#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25151#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25150#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25149#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25148#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25147#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25146#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25100#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25140#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25132#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25129#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25123#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25121#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25119#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25106#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25101#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25099#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25098#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25097#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25096#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25095#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25094#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25093#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25092#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25091#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25090#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25089#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25088#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25087#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25086#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25085#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25084#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25083#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25082#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25081#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25080#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25079#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25078#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25077#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25076#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25074#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25073#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25072#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25071#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25070#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25069#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25068#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25067#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25066#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25065#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25064#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25063#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25026#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25059#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25054#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25050#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25048#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25046#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25044#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25043#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25041#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25040#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25039#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25036#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25032#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24993#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25027#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25025#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25024#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25023#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25022#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25016#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25015#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25014#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25011#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25010#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25009#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25008#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25007#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25006#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25005#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25004#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25003#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25002#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25001#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25000#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24999#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24998#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24997#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24996#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24995#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24963#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24994#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24992#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24991#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24990#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24989#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24988#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24987#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24986#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24985#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24984#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24983#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24982#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24981#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24980#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24979#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24978#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24975#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24974#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24972#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24970#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24969#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24968#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24967#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24966#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24965#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24936#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24964#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24961#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24960#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24959#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24956#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24955#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24953#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24949#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24947#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24946#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24945#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24942#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24940#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24939#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24912#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24937#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24935#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24934#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24933#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24931#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24930#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24929#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24928#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24927#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24923#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24922#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24921#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24920#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24919#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24918#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24915#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24891#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24913#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24909#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24908#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24907#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24906#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24905#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24904#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24903#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24902#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24901#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24900#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24899#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24898#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24897#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24896#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24894#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24892#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24890#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24889#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24888#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24887#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24886#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24885#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24884#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24883#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24882#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24881#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24880#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24879#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24878#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24877#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24876#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24875#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24858#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24874#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24872#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24871#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24870#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24869#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24868#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24867#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24866#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24865#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24864#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24863#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24861#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24860#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24846#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24859#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24857#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24856#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24855#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24854#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24852#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24851#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24850#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24849#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24848#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24837#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24847#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24845#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24844#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24843#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24842#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24841#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24840#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24839#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24831#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24838#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24836#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24835#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24834#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24833#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24827#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24832#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 24830#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24829#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 24828#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 24826#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24824#L12 [2018-11-28 13:10:12,174 INFO L796 eck$LassoCheckResult]: Loop: 24824#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 24825#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 24824#L12 [2018-11-28 13:10:12,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:12,174 INFO L82 PathProgramCache]: Analyzing trace with hash 571926090, now seen corresponding path program 30 times [2018-11-28 13:10:12,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:12,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:12,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:12,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:12,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:12,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:12,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 26 times [2018-11-28 13:10:12,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:12,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:12,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:12,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:12,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash -134840737, now seen corresponding path program 3 times [2018-11-28 13:10:12,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:12,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:12,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:12,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:12,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:10:38,364 WARN L180 SmtUtils]: Spent 25.86 s on a formula simplification. DAG size of input: 2133 DAG size of output: 671 [2018-11-28 13:10:38,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:10:38 BoogieIcfgContainer [2018-11-28 13:10:38,460 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:10:38,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:10:38,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:10:38,460 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:10:38,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:45" (3/4) ... [2018-11-28 13:10:38,462 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 13:10:38,569 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a1ab3c2c-40a0-4228-8365-651a69d0a418/bin-2019/uautomizer/witness.graphml [2018-11-28 13:10:38,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:10:38,570 INFO L168 Benchmark]: Toolchain (without parser) took 53200.56 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 860.4 MB). Free memory was 954.4 MB in the beginning and 791.4 MB in the end (delta: 163.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-28 13:10:38,571 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:10:38,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.93 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:10:38,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.08 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:10:38,571 INFO L168 Benchmark]: Boogie Preprocessor took 13.54 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:10:38,571 INFO L168 Benchmark]: RCFGBuilder took 183.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:10:38,572 INFO L168 Benchmark]: BuchiAutomizer took 52738.28 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 723.5 MB). Free memory was 1.1 GB in the beginning and 812.5 MB in the end (delta: 307.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-28 13:10:38,572 INFO L168 Benchmark]: Witness Printer took 109.63 ms. Allocated memory is still 1.9 GB. Free memory was 812.5 MB in the beginning and 791.4 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:10:38,573 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 131.93 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.08 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.54 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 183.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 52738.28 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 723.5 MB). Free memory was 1.1 GB in the beginning and 812.5 MB in the end (delta: 307.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 109.63 ms. Allocated memory is still 1.9 GB. Free memory was 812.5 MB in the beginning and 791.4 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 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 30 terminating modules (26 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + range and consists of 3 locations. One deterministic module has affine ranking function range + -1 * i and consists of 3 locations. One deterministic module has affine ranking function range and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 3 locations. 26 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 643 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 52.6s and 30 iterations. TraceHistogramMax:211. Analysis of lassos took 36.9s. Construction of modules took 4.5s. Büchi inclusion checks took 10.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 29. Automata minimization 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 1288 StatesRemovedByMinimization, 27 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 643 states and ocurred in iteration 29. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/3 HoareTripleCheckerStatistics: 71 SDtfs, 2301 SDslu, 3 SDs, 0 SdLazy, 13580 SolverSat, 1796 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc4 concLT1 SILN21 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax167 hnf100 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf95 smp74 dnf100 smp100 tf109 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {range=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1fe3f642=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] i = __VERIFIER_nondet_int() [L9] range = 20 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range Loop: [L12] COND FALSE !(!(0 == i && i == range)) [L11] COND TRUE 0 <= i && i <= range End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...