./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/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 32bit --witnessprinter.graph.data.programhash 279fae57395782089eff32ec1396d1726d808c7f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:22:59,768 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:22:59,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:22:59,780 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:22:59,780 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:22:59,781 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:22:59,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:22:59,783 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:22:59,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:22:59,785 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:22:59,786 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:22:59,786 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:22:59,787 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:22:59,788 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:22:59,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:22:59,789 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:22:59,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:22:59,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:22:59,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:22:59,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:22:59,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:22:59,796 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:22:59,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:22:59,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:22:59,799 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:22:59,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:22:59,800 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:22:59,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:22:59,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:22:59,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:22:59,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:22:59,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:22:59,804 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:22:59,804 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:22:59,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:22:59,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:22:59,805 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:22:59,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:22:59,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:22:59,819 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:22:59,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:22:59,820 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:22:59,820 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:22:59,820 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:22:59,820 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:22:59,821 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:22:59,821 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:22:59,821 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:22:59,821 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:22:59,821 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:22:59,822 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:22:59,822 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:22:59,822 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:22:59,822 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:22:59,822 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:22:59,823 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:22:59,823 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:22:59,823 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:22:59,823 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:22:59,823 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:22:59,823 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:22:59,824 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:22:59,824 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:22:59,824 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:22:59,824 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:22:59,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:22:59,825 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:22:59,825 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:22:59,826 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:22:59,826 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_e962474f-d6cd-4366-8054-47e7f8d0d4a1/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 279fae57395782089eff32ec1396d1726d808c7f [2018-11-18 10:22:59,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:22:59,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:22:59,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:22:59,870 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:22:59,870 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:22:59,871 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-18 10:22:59,928 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/data/14e2c0645/b5e1a3c3cf6448baad8ecaf3c1b730e3/FLAG95d33ee38 [2018-11-18 10:23:00,288 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:23:00,288 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-18 10:23:00,294 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/data/14e2c0645/b5e1a3c3cf6448baad8ecaf3c1b730e3/FLAG95d33ee38 [2018-11-18 10:23:00,304 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/data/14e2c0645/b5e1a3c3cf6448baad8ecaf3c1b730e3 [2018-11-18 10:23:00,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:23:00,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:23:00,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:23:00,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:23:00,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:23:00,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163f556a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00, skipping insertion in model container [2018-11-18 10:23:00,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:23:00,348 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:23:00,487 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:23:00,495 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:23:00,511 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:23:00,522 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:23:00,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00 WrapperNode [2018-11-18 10:23:00,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:23:00,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:23:00,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:23:00,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:23:00,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:23:00,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:23:00,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:23:00,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:23:00,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... [2018-11-18 10:23:00,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:23:00,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:23:00,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:23:00,629 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:23:00,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/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-18 10:23:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:23:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:23:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:23:00,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:23:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:23:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:23:00,942 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:23:00,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:23:00 BoogieIcfgContainer [2018-11-18 10:23:00,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:23:00,943 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:23:00,943 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:23:00,947 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:23:00,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:23:00,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:23:00" (1/3) ... [2018-11-18 10:23:00,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12a3725c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:23:00, skipping insertion in model container [2018-11-18 10:23:00,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:23:00,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:00" (2/3) ... [2018-11-18 10:23:00,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12a3725c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:23:00, skipping insertion in model container [2018-11-18 10:23:00,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:23:00,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:23:00" (3/3) ... [2018-11-18 10:23:00,951 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum_false-unreach-call_true-termination.i [2018-11-18 10:23:00,987 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:23:00,988 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:23:00,988 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:23:00,988 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:23:00,988 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:23:00,988 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:23:00,988 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:23:00,988 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:23:00,988 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:23:00,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2018-11-18 10:23:01,014 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2018-11-18 10:23:01,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:01,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:01,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 10:23:01,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:23:01,019 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:23:01,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2018-11-18 10:23:01,021 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2018-11-18 10:23:01,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:01,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:01,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 10:23:01,021 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:23:01,027 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 33#L33true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 15#L7-4true [2018-11-18 10:23:01,027 INFO L796 eck$LassoCheckResult]: Loop: 15#L7-4true assume true; 7#L7-1true assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 19#L7-3true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 15#L7-4true [2018-11-18 10:23:01,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-18 10:23:01,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:01,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:01,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:01,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash 38890, now seen corresponding path program 1 times [2018-11-18 10:23:01,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:01,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:01,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:01,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:01,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:01,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:01,134 INFO L82 PathProgramCache]: Analyzing trace with hash 889508777, now seen corresponding path program 1 times [2018-11-18 10:23:01,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:01,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:01,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:01,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:01,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:01,350 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:01,351 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:01,351 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:01,351 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:01,352 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:23:01,352 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:01,352 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:01,352 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:01,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 10:23:01,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:01,352 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:01,378 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-18 10:23:01,384 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-18 10:23:01,388 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-18 10:23:01,392 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-18 10:23:01,405 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-18 10:23:01,408 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-18 10:23:01,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:01,529 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-18 10:23:01,532 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-18 10:23:01,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:01,539 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-18 10:23:01,540 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-18 10:23:01,542 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-18 10:23:01,544 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-18 10:23:01,547 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-18 10:23:01,549 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-18 10:23:01,551 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-18 10:23:01,553 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-18 10:23:01,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:01,727 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:01,731 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:23:01,733 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-18 10:23:01,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:01,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:01,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:01,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:01,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:01,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:01,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:01,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:01,741 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-18 10:23:01,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:01,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:01,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:01,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:01,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:01,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:01,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:01,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:01,745 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-18 10:23:01,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:01,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:01,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:01,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:01,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:01,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:01,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:01,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:01,748 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-18 10:23:01,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:01,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:01,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:01,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:01,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:01,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:01,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:01,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:01,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:01,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:01,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:01,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:01,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:01,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:01,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:01,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:01,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:01,755 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-18 10:23:01,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:01,756 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:23:01,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:01,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:01,760 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:23:01,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:01,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:01,781 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-18 10:23:01,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:01,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:01,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:01,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:01,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:01,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:01,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:01,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:01,784 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-18 10:23:01,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:01,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:01,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:01,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:01,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:01,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:01,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:23:01,879 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 10:23:01,879 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 10:23:01,881 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:23:01,883 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:23:01,883 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:23:01,884 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, ~N~0) = -1*ULTIMATE.start_init_nondet_~i~0 + 1*~N~0 Supporting invariants [] [2018-11-18 10:23:01,903 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 10:23:01,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:01,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:01,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:01,975 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-18 10:23:01,986 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-18 10:23:01,987 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states. Second operand 4 states. [2018-11-18 10:23:02,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states.. Second operand 4 states. Result 100 states and 142 transitions. Complement of second has 7 states. [2018-11-18 10:23:02,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:23:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:23:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2018-11-18 10:23:02,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-18 10:23:02,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:02,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 10:23:02,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:02,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-18 10:23:02,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:02,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 142 transitions. [2018-11-18 10:23:02,100 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 10:23:02,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 29 states and 39 transitions. [2018-11-18 10:23:02,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-18 10:23:02,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-18 10:23:02,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2018-11-18 10:23:02,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:02,106 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-11-18 10:23:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2018-11-18 10:23:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 10:23:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 10:23:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-11-18 10:23:02,128 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-11-18 10:23:02,128 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-11-18 10:23:02,128 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:23:02,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 39 transitions. [2018-11-18 10:23:02,129 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 10:23:02,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:02,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:02,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:23:02,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:02,130 INFO L794 eck$LassoCheckResult]: Stem: 219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 208#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 212#L7-4 assume true; 199#L7-1 assume !(init_nondet_~i~0 < ~N~0); 196#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 193#L18-4 [2018-11-18 10:23:02,130 INFO L796 eck$LassoCheckResult]: Loop: 193#L18-4 assume true; 202#L18-1 assume !!(rangesum_~i~1 < ~N~0); 204#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 192#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 193#L18-4 [2018-11-18 10:23:02,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,130 INFO L82 PathProgramCache]: Analyzing trace with hash 889508719, now seen corresponding path program 1 times [2018-11-18 10:23:02,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:02,171 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-18 10:23:02,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:02,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:02,174 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:02,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1667402, now seen corresponding path program 1 times [2018-11-18 10:23:02,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:02,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:02,242 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-18 10:23:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:02,274 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-18 10:23:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:02,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2018-11-18 10:23:02,276 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 10:23:02,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 40 transitions. [2018-11-18 10:23:02,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 10:23:02,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-18 10:23:02,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-11-18 10:23:02,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:02,277 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-18 10:23:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-11-18 10:23:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 10:23:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 10:23:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-18 10:23:02,280 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-18 10:23:02,280 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-18 10:23:02,280 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:23:02,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-11-18 10:23:02,280 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 10:23:02,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:02,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:02,281 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:02,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:02,281 INFO L794 eck$LassoCheckResult]: Stem: 286#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 275#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 279#L7-4 assume true; 267#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 268#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 280#L7-4 assume true; 266#L7-1 assume !(init_nondet_~i~0 < ~N~0); 263#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 260#L18-4 [2018-11-18 10:23:02,281 INFO L796 eck$LassoCheckResult]: Loop: 260#L18-4 assume true; 269#L18-1 assume !!(rangesum_~i~1 < ~N~0); 271#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 259#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 260#L18-4 [2018-11-18 10:23:02,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,282 INFO L82 PathProgramCache]: Analyzing trace with hash -592231672, now seen corresponding path program 1 times [2018-11-18 10:23:02,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:02,309 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-18 10:23:02,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:23:02,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:23:02,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:02,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:02,346 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-18 10:23:02,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:23:02,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 10:23:02,362 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:02,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1667402, now seen corresponding path program 2 times [2018-11-18 10:23:02,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:23:02,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:23:02,412 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-18 10:23:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:02,446 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2018-11-18 10:23:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:23:02,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-11-18 10:23:02,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 10:23:02,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 43 transitions. [2018-11-18 10:23:02,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 10:23:02,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-18 10:23:02,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2018-11-18 10:23:02,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:02,449 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 10:23:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2018-11-18 10:23:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-18 10:23:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 10:23:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-11-18 10:23:02,451 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-18 10:23:02,451 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-18 10:23:02,451 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:23:02,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2018-11-18 10:23:02,452 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 10:23:02,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:02,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:02,452 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 10:23:02,452 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:02,452 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 372#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 376#L7-4 assume true; 377#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 379#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 378#L7-4 assume true; 364#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 365#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 387#L7-4 assume true; 363#L7-1 assume !(init_nondet_~i~0 < ~N~0); 360#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 357#L18-4 [2018-11-18 10:23:02,453 INFO L796 eck$LassoCheckResult]: Loop: 357#L18-4 assume true; 366#L18-1 assume !!(rangesum_~i~1 < ~N~0); 368#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 356#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 357#L18-4 [2018-11-18 10:23:02,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,453 INFO L82 PathProgramCache]: Analyzing trace with hash 553648335, now seen corresponding path program 2 times [2018-11-18 10:23:02,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1667402, now seen corresponding path program 3 times [2018-11-18 10:23:02,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1401922792, now seen corresponding path program 1 times [2018-11-18 10:23:02,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:02,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:23:02,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:02,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:23:02,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:23:02,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:23:02,575 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-18 10:23:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:02,648 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-18 10:23:02,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:23:02,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 53 transitions. [2018-11-18 10:23:02,650 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 10:23:02,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 53 transitions. [2018-11-18 10:23:02,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-18 10:23:02,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-18 10:23:02,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 53 transitions. [2018-11-18 10:23:02,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:02,651 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-18 10:23:02,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 53 transitions. [2018-11-18 10:23:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-18 10:23:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 10:23:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-18 10:23:02,654 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-18 10:23:02,654 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-18 10:23:02,654 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:23:02,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 50 transitions. [2018-11-18 10:23:02,655 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 10:23:02,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:02,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:02,657 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:02,658 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:02,658 INFO L794 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 456#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 457#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 461#L7-4 assume true; 450#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 451#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 462#L7-4 assume true; 463#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 477#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 476#L7-4 assume true; 449#L7-1 assume !(init_nondet_~i~0 < ~N~0); 445#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 446#L18-4 assume true; 452#L18-1 assume !!(rangesum_~i~1 < ~N~0); 453#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 441#L18-3 [2018-11-18 10:23:02,658 INFO L796 eck$LassoCheckResult]: Loop: 441#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 442#L18-4 assume true; 478#L18-1 assume !!(rangesum_~i~1 < ~N~0); 479#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 441#L18-3 [2018-11-18 10:23:02,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1063155342, now seen corresponding path program 1 times [2018-11-18 10:23:02,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2019992, now seen corresponding path program 4 times [2018-11-18 10:23:02,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,686 INFO L82 PathProgramCache]: Analyzing trace with hash -418039131, now seen corresponding path program 1 times [2018-11-18 10:23:02,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:02,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:23:02,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:23:02,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:23:02,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:02,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:23:02,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:23:02,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 10:23:02,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:23:02,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:23:02,853 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. cyclomatic complexity: 14 Second operand 7 states. [2018-11-18 10:23:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:02,929 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-18 10:23:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:23:02,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 68 transitions. [2018-11-18 10:23:02,930 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:23:02,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 68 transitions. [2018-11-18 10:23:02,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-18 10:23:02,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-18 10:23:02,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 68 transitions. [2018-11-18 10:23:02,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:02,932 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-11-18 10:23:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 68 transitions. [2018-11-18 10:23:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-11-18 10:23:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 10:23:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-11-18 10:23:02,935 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-18 10:23:02,936 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-18 10:23:02,936 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:23:02,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2018-11-18 10:23:02,937 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 10:23:02,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:02,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:02,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:02,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:02,938 INFO L794 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 624#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 625#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 629#L7-4 assume true; 618#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 619#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 630#L7-4 assume true; 631#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 650#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 649#L7-4 assume true; 617#L7-1 assume !(init_nondet_~i~0 < ~N~0); 613#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 614#L18-4 assume true; 655#L18-1 assume !!(rangesum_~i~1 < ~N~0); 654#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 609#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 610#L18-4 assume true; 620#L18-1 assume !!(rangesum_~i~1 < ~N~0); 621#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 638#L18-3 [2018-11-18 10:23:02,938 INFO L796 eck$LassoCheckResult]: Loop: 638#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 653#L18-4 assume true; 651#L18-1 assume !!(rangesum_~i~1 < ~N~0); 652#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 638#L18-3 [2018-11-18 10:23:02,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash -418039129, now seen corresponding path program 1 times [2018-11-18 10:23:02,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2019992, now seen corresponding path program 5 times [2018-11-18 10:23:02,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:02,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:02,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:02,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1893053890, now seen corresponding path program 2 times [2018-11-18 10:23:02,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:02,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:02,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:02,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 10:23:03,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:23:03,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:23:03,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:23:03,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:23:03,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:23:03,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:03,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:23:03,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-11-18 10:23:03,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:23:03,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:23:03,247 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand 14 states. [2018-11-18 10:23:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:03,428 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-11-18 10:23:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:23:03,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 119 transitions. [2018-11-18 10:23:03,430 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 33 [2018-11-18 10:23:03,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 104 states and 119 transitions. [2018-11-18 10:23:03,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-11-18 10:23:03,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2018-11-18 10:23:03,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 119 transitions. [2018-11-18 10:23:03,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:03,432 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-11-18 10:23:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 119 transitions. [2018-11-18 10:23:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2018-11-18 10:23:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 10:23:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2018-11-18 10:23:03,436 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2018-11-18 10:23:03,436 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2018-11-18 10:23:03,436 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:23:03,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 105 transitions. [2018-11-18 10:23:03,436 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 30 [2018-11-18 10:23:03,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:03,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:03,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:03,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:03,437 INFO L794 eck$LassoCheckResult]: Stem: 899#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 875#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 876#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 881#L7-4 assume true; 882#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 886#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 883#L7-4 assume true; 884#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 910#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 911#L7-4 assume true; 867#L7-1 assume !(init_nondet_~i~0 < ~N~0); 868#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 928#L18-4 assume true; 929#L18-1 assume !!(rangesum_~i~1 < ~N~0); 920#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 921#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 934#L18-4 assume true; 871#L18-1 assume !!(rangesum_~i~1 < ~N~0); 872#L19 [2018-11-18 10:23:03,437 INFO L796 eck$LassoCheckResult]: Loop: 872#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 916#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 917#L18-4 assume true; 906#L18-1 assume !!(rangesum_~i~1 < ~N~0); 872#L19 [2018-11-18 10:23:03,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1371988187, now seen corresponding path program 2 times [2018-11-18 10:23:03,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:03,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:03,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:03,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1971784, now seen corresponding path program 1 times [2018-11-18 10:23:03,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:03,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:03,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:03,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1601501730, now seen corresponding path program 3 times [2018-11-18 10:23:03,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:03,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:03,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:03,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:03,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:03,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:23:03,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:23:03,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:23:03,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 10:23:03,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:23:03,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:03,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:23:03,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-18 10:23:03,578 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:03,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:03,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:03,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:03,578 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:23:03,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:03,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:03,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:03,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration7_Loop [2018-11-18 10:23:03,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:03,579 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:03,579 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-18 10:23:03,582 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-18 10:23:03,617 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:03,618 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:03,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:03,621 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:03,624 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:03,624 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post2=0} Honda state: {ULTIMATE.start_rangesum_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:03,640 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:03,640 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/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-18 10:23:03,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:23:03,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:04,058 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:23:04,059 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:04,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:04,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:04,060 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:04,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:23:04,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:04,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:04,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:04,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration7_Loop [2018-11-18 10:23:04,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:04,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:04,061 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-18 10:23:04,062 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-18 10:23:04,109 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:04,109 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:23:04,109 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-18 10:23:04,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:04,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:04,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:04,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:04,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:04,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:04,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:04,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:04,112 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-18 10:23:04,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:04,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:04,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:04,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:04,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:04,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:04,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:04,115 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:23:04,117 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:23:04,117 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:23:04,117 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:23:04,117 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:23:04,117 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:23:04,117 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_rangesum_~i~1) = 5*~N~0 - 8*ULTIMATE.start_rangesum_~i~1 Supporting invariants [] [2018-11-18 10:23:04,117 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:23:04,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:04,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:04,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:04,202 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-18 10:23:04,202 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-18 10:23:04,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 105 transitions. cyclomatic complexity: 24 Second operand 4 states. [2018-11-18 10:23:04,245 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 105 transitions. cyclomatic complexity: 24. Second operand 4 states. Result 120 states and 144 transitions. Complement of second has 9 states. [2018-11-18 10:23:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:23:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:23:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-18 10:23:04,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-18 10:23:04,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:04,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-18 10:23:04,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:04,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 8 letters. [2018-11-18 10:23:04,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:04,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 144 transitions. [2018-11-18 10:23:04,250 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2018-11-18 10:23:04,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 108 states and 129 transitions. [2018-11-18 10:23:04,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2018-11-18 10:23:04,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2018-11-18 10:23:04,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 129 transitions. [2018-11-18 10:23:04,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:04,251 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 129 transitions. [2018-11-18 10:23:04,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 129 transitions. [2018-11-18 10:23:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-11-18 10:23:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 10:23:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-11-18 10:23:04,256 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-11-18 10:23:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:23:04,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:23:04,256 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 13 states. [2018-11-18 10:23:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:04,446 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-11-18 10:23:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:23:04,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 129 transitions. [2018-11-18 10:23:04,447 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2018-11-18 10:23:04,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 98 states and 115 transitions. [2018-11-18 10:23:04,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-18 10:23:04,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-18 10:23:04,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 115 transitions. [2018-11-18 10:23:04,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:04,449 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 115 transitions. [2018-11-18 10:23:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 115 transitions. [2018-11-18 10:23:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-18 10:23:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 10:23:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2018-11-18 10:23:04,452 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 113 transitions. [2018-11-18 10:23:04,452 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 113 transitions. [2018-11-18 10:23:04,452 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:23:04,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 113 transitions. [2018-11-18 10:23:04,453 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2018-11-18 10:23:04,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:04,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:04,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:04,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:04,454 INFO L794 eck$LassoCheckResult]: Stem: 1501#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1477#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1478#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1483#L7-4 assume true; 1484#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1490#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1485#L7-4 assume true; 1486#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1546#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1544#L7-4 assume true; 1469#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1470#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1545#L7-4 assume true; 1543#L7-1 assume !(init_nondet_~i~0 < ~N~0); 1542#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1541#L18-4 assume true; 1471#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1472#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1496#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1553#L18-4 assume true; 1473#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1474#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1460#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1461#L18-4 assume true; 1489#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1551#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1458#L18-3 [2018-11-18 10:23:04,454 INFO L796 eck$LassoCheckResult]: Loop: 1458#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1459#L18-4 assume true; 1547#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1548#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1458#L18-3 [2018-11-18 10:23:04,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash 897048517, now seen corresponding path program 3 times [2018-11-18 10:23:04,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:04,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:04,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:04,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:04,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2019992, now seen corresponding path program 6 times [2018-11-18 10:23:04,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:04,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:04,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:04,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash -212258724, now seen corresponding path program 4 times [2018-11-18 10:23:04,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:04,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:04,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:23:04,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:23:04,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:23:04,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 10:23:04,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 10:23:04,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:23:04,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:04,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:23:04,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-11-18 10:23:04,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 10:23:04,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-18 10:23:04,725 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. cyclomatic complexity: 24 Second operand 19 states. [2018-11-18 10:23:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:04,985 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2018-11-18 10:23:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 10:23:04,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 192 transitions. [2018-11-18 10:23:04,987 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 24 [2018-11-18 10:23:04,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 148 states and 172 transitions. [2018-11-18 10:23:04,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2018-11-18 10:23:04,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-18 10:23:04,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 172 transitions. [2018-11-18 10:23:04,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:04,988 INFO L705 BuchiCegarLoop]: Abstraction has 148 states and 172 transitions. [2018-11-18 10:23:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 172 transitions. [2018-11-18 10:23:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2018-11-18 10:23:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 10:23:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2018-11-18 10:23:04,992 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 149 transitions. [2018-11-18 10:23:04,992 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 149 transitions. [2018-11-18 10:23:04,992 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 10:23:04,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 149 transitions. [2018-11-18 10:23:04,993 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2018-11-18 10:23:04,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:04,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:04,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:04,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:04,993 INFO L794 eck$LassoCheckResult]: Stem: 1896#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1874#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1875#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1880#L7-4 assume true; 1866#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1867#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1881#L7-4 assume true; 1882#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1948#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1939#L7-4 assume true; 1940#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1946#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1947#L7-4 assume true; 1944#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1945#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1943#L7-4 assume true; 1942#L7-1 assume !(init_nondet_~i~0 < ~N~0); 1941#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1938#L18-4 assume true; 1937#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1936#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1935#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1934#L18-4 assume true; 1933#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1931#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1856#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1857#L18-4 assume true; 1932#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1928#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1929#L18-3 [2018-11-18 10:23:04,994 INFO L796 eck$LassoCheckResult]: Loop: 1929#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1924#L18-4 assume true; 1925#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1930#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1929#L18-3 [2018-11-18 10:23:04,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash 335775966, now seen corresponding path program 5 times [2018-11-18 10:23:04,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:04,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:04,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:04,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:04,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:05,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:23:05,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:23:05,210 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 10:23:05,224 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-18 10:23:05,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:23:05,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:05,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:23:05,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-18 10:23:05,314 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:05,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:05,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2019992, now seen corresponding path program 7 times [2018-11-18 10:23:05,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:05,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:05,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:05,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:05,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:05,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 10:23:05,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:23:05,343 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. cyclomatic complexity: 28 Second operand 18 states. [2018-11-18 10:23:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:05,717 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-18 10:23:05,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 10:23:05,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 181 transitions. [2018-11-18 10:23:05,718 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 23 [2018-11-18 10:23:05,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 156 states and 178 transitions. [2018-11-18 10:23:05,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2018-11-18 10:23:05,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2018-11-18 10:23:05,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 178 transitions. [2018-11-18 10:23:05,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:05,720 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 178 transitions. [2018-11-18 10:23:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 178 transitions. [2018-11-18 10:23:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2018-11-18 10:23:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 10:23:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-11-18 10:23:05,725 INFO L728 BuchiCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-11-18 10:23:05,725 INFO L608 BuchiCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-11-18 10:23:05,725 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 10:23:05,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 161 transitions. [2018-11-18 10:23:05,726 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2018-11-18 10:23:05,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:05,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:05,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:05,727 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:05,727 INFO L794 eck$LassoCheckResult]: Stem: 2313#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2291#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2292#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2296#L7-4 assume true; 2297#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2299#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2298#L7-4 assume true; 2283#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2284#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2374#L7-4 assume true; 2373#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2372#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2370#L7-4 assume true; 2367#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2368#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2366#L7-4 assume true; 2365#L7-1 assume !(init_nondet_~i~0 < ~N~0); 2364#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2362#L18-4 assume true; 2361#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2360#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2274#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2275#L18-4 assume true; 2287#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2288#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2356#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2355#L18-4 assume true; 2352#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2350#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2310#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2353#L18-4 assume true; 2351#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2347#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2346#L18-3 [2018-11-18 10:23:05,727 INFO L796 eck$LassoCheckResult]: Loop: 2346#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2344#L18-4 assume true; 2345#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2349#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2346#L18-3 [2018-11-18 10:23:05,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash -479931401, now seen corresponding path program 6 times [2018-11-18 10:23:05,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:05,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:05,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:05,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:05,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2019992, now seen corresponding path program 8 times [2018-11-18 10:23:05,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:05,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:05,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:05,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:05,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:05,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1013758862, now seen corresponding path program 7 times [2018-11-18 10:23:05,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:05,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:05,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 10:23:05,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:23:05,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e962474f-d6cd-4366-8054-47e7f8d0d4a1/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:23:05,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:05,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:06,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:23:06,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2018-11-18 10:23:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 10:23:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-11-18 10:23:06,055 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. cyclomatic complexity: 28 Second operand 21 states. [2018-11-18 10:23:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:06,527 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2018-11-18 10:23:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 10:23:06,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 273 transitions. [2018-11-18 10:23:06,528 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2018-11-18 10:23:06,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 218 states and 249 transitions. [2018-11-18 10:23:06,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2018-11-18 10:23:06,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2018-11-18 10:23:06,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 218 states and 249 transitions. [2018-11-18 10:23:06,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:06,529 INFO L705 BuchiCegarLoop]: Abstraction has 218 states and 249 transitions. [2018-11-18 10:23:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states and 249 transitions. [2018-11-18 10:23:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 169. [2018-11-18 10:23:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-18 10:23:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 193 transitions. [2018-11-18 10:23:06,533 INFO L728 BuchiCegarLoop]: Abstraction has 169 states and 193 transitions. [2018-11-18 10:23:06,533 INFO L608 BuchiCegarLoop]: Abstraction has 169 states and 193 transitions. [2018-11-18 10:23:06,533 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 10:23:06,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 193 transitions. [2018-11-18 10:23:06,534 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2018-11-18 10:23:06,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:06,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:06,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:06,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:06,535 INFO L794 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2845#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2846#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2850#L7-4 assume true; 2851#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2931#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2852#L7-4 assume true; 2837#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2838#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2855#L7-4 assume true; 2926#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2925#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2923#L7-4 assume true; 2922#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2921#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2920#L7-4 assume true; 2918#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2919#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2917#L7-4 assume true; 2916#L7-1 assume !(init_nondet_~i~0 < ~N~0); 2915#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2914#L18-4 assume true; 2913#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2912#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2827#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2828#L18-4 assume true; 2910#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2866#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2867#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2911#L18-4 assume true; 2909#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2905#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2904#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2908#L18-4 assume true; 2907#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2902#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2898#L18-3 [2018-11-18 10:23:06,536 INFO L796 eck$LassoCheckResult]: Loop: 2898#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2899#L18-4 assume true; 2906#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2900#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2898#L18-3 [2018-11-18 10:23:06,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1846963390, now seen corresponding path program 8 times [2018-11-18 10:23:06,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:06,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:06,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:06,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:06,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:06,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:06,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2019992, now seen corresponding path program 9 times [2018-11-18 10:23:06,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:06,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:06,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:06,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:06,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:06,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:06,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1871091925, now seen corresponding path program 9 times [2018-11-18 10:23:06,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:06,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:06,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:06,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:06,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:07,332 WARN L180 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 144 [2018-11-18 10:23:07,608 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-18 10:23:07,609 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:07,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:07,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:07,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:07,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:23:07,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:07,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:07,609 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:07,609 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration11_Lasso [2018-11-18 10:23:07,609 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:07,609 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:07,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:07,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:07,615 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-18 10:23:07,616 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-18 10:23:07,618 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-18 10:23:07,619 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-18 10:23:07,621 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-18 10:23:07,622 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-18 10:23:07,740 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-18 10:23:07,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-18 10:23:07,742 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-18 10:23:07,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:07,744 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-18 10:23:07,745 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-18 10:23:07,745 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-18 10:23:07,746 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-18 10:23:07,747 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-18 10:23:07,748 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-18 10:23:07,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:07,750 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-18 10:23:07,750 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-18 10:23:07,751 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-18 10:23:07,753 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-18 10:23:07,762 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-18 10:23:07,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:07,980 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:23:07,980 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-18 10:23:07,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:07,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:07,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:07,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:07,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:07,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:07,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:07,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:07,982 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-18 10:23:07,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:07,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:07,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:07,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:07,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:07,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:07,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:07,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:07,984 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-18 10:23:07,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:07,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:07,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:07,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:07,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:07,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:07,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:07,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:07,985 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-18 10:23:07,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:07,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:07,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:07,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:07,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:07,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:07,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:07,987 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-18 10:23:07,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:07,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:07,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:07,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:07,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:07,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:07,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:07,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:07,988 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-18 10:23:07,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:07,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:07,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:07,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:07,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:07,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:07,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:07,993 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-18 10:23:07,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:07,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:07,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:07,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:07,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:07,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:07,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:07,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:07,994 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-18 10:23:07,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:07,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:07,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:07,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:07,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:07,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:08,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:08,002 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-18 10:23:08,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:08,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:08,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:08,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:08,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:08,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:08,027 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:23:08,045 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 10:23:08,045 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 10:23:08,045 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:23:08,046 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:23:08,046 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:23:08,046 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -1*ULTIMATE.start_rangesum_~i~1 + 1*~N~0 Supporting invariants [] [2018-11-18 10:23:08,062 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-18 10:23:08,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:08,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:08,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:08,108 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-18 10:23:08,108 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-18 10:23:08,108 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 193 transitions. cyclomatic complexity: 31 Second operand 4 states. [2018-11-18 10:23:08,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 193 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 276 states and 323 transitions. Complement of second has 7 states. [2018-11-18 10:23:08,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:23:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:23:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2018-11-18 10:23:08,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 36 letters. Loop has 4 letters. [2018-11-18 10:23:08,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:08,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-18 10:23:08,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:08,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 36 letters. Loop has 8 letters. [2018-11-18 10:23:08,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:08,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 323 transitions. [2018-11-18 10:23:08,135 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2018-11-18 10:23:08,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 256 states and 295 transitions. [2018-11-18 10:23:08,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 211 [2018-11-18 10:23:08,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2018-11-18 10:23:08,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 295 transitions. [2018-11-18 10:23:08,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:08,136 INFO L705 BuchiCegarLoop]: Abstraction has 256 states and 295 transitions. [2018-11-18 10:23:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 295 transitions. [2018-11-18 10:23:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 175. [2018-11-18 10:23:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-18 10:23:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 204 transitions. [2018-11-18 10:23:08,138 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 204 transitions. [2018-11-18 10:23:08,138 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 204 transitions. [2018-11-18 10:23:08,138 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 10:23:08,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 204 transitions. [2018-11-18 10:23:08,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-18 10:23:08,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:08,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:08,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:08,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:23:08,144 INFO L794 eck$LassoCheckResult]: Stem: 3478#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 3457#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 3458#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);assume { :begin_inline_init_nondet } true;init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 3462#L7-4 assume true; 3463#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3466#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3464#L7-4 assume true; 3465#L7-1 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3537#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3535#L7-4 assume true; 3534#L7-1 assume !(init_nondet_~i~0 < ~N~0); 3533#L5 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3532#L18-4 assume true; 3531#L18-1 assume !!(rangesum_~i~1 < ~N~0); 3530#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 3529#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3528#L18-4 assume true; 3527#L18-1 assume !!(rangesum_~i~1 < ~N~0); 3526#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 3525#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3524#L18-4 assume true; 3523#L18-1 assume !(rangesum_~i~1 < ~N~0); 3522#L18-5 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3521#L27 main_#t~ret5 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_rangesum } true;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3520#L18-10 assume true; 3519#L18-7 assume !!(rangesum_~i~1 < ~N~0); 3518#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 3517#L18-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3516#L18-10 assume true; 3515#L18-7 assume !!(rangesum_~i~1 < ~N~0); 3514#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 3509#L18-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3510#L18-10 assume true; 3486#L18-7 assume !(rangesum_~i~1 < ~N~0); 3487#L18-11 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3442#L27-1 main_#t~ret8 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; 3443#L46-4 [2018-11-18 10:23:08,144 INFO L796 eck$LassoCheckResult]: Loop: 3443#L46-4 assume true; 3480#L46-1 assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; 3479#L46-3 main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; 3443#L46-4 [2018-11-18 10:23:08,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash 742534517, now seen corresponding path program 1 times [2018-11-18 10:23:08,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:08,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:08,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:08,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:08,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:08,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash 105421, now seen corresponding path program 1 times [2018-11-18 10:23:08,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:08,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:08,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:08,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:08,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1764297177, now seen corresponding path program 1 times [2018-11-18 10:23:08,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:08,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:08,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:08,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:08,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:08,531 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 143 [2018-11-18 10:23:08,687 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2018-11-18 10:23:08,688 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:08,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:08,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:08,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:08,688 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:23:08,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:08,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:08,688 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:08,688 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-18 10:23:08,688 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:08,688 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:08,691 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-18 10:23:08,692 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-18 10:23:08,693 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-18 10:23:08,693 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-18 10:23:08,694 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-18 10:23:08,696 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-18 10:23:08,697 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-18 10:23:08,718 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 10:23:08,719 INFO L168 Benchmark]: Toolchain (without parser) took 8412.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 955.8 MB in the beginning and 968.4 MB in the end (delta: -12.7 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:08,720 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:23:08,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.43 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 939.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:08,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.23 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:23:08,720 INFO L168 Benchmark]: Boogie Preprocessor took 68.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 939.7 MB in the beginning and 1.2 GB in the end (delta: -214.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:08,721 INFO L168 Benchmark]: RCFGBuilder took 313.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:08,721 INFO L168 Benchmark]: BuchiAutomizer took 7775.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 968.4 MB in the end (delta: 160.5 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:08,724 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.43 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 939.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.23 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 939.7 MB in the beginning and 1.2 GB in the end (delta: -214.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 313.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7775.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 968.4 MB in the end (delta: 160.5 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...