./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/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_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/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_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/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-1dbac8b [2018-10-27 06:10:29,848 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:29,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:29,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:29,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:29,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:29,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:29,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:29,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:29,865 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:29,866 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:29,866 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:29,867 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:29,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:29,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:29,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:29,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:29,872 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:29,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:29,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:29,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:29,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:29,880 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:29,880 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:29,880 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:29,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:29,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:29,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:29,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:29,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:29,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:29,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:29,886 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:29,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:29,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:29,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:29,889 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:10:29,901 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:29,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:29,903 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:29,903 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:29,903 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:29,903 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:29,904 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:29,904 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:29,904 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:29,904 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:29,904 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:29,904 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:29,904 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:10:29,905 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:29,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:29,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:10:29,905 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:29,905 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:29,905 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:29,905 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:29,906 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:10:29,906 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:29,906 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:29,906 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:29,906 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:29,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:29,909 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:29,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:29,909 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:29,909 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:29,910 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:29,910 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_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/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-10-27 06:10:29,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:29,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:29,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:29,953 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:29,953 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:29,954 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-10-27 06:10:29,999 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/data/27efa5583/14ad1d08e122444a85de6bf78424cfac/FLAG32198cb6f [2018-10-27 06:10:30,384 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:30,384 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-10-27 06:10:30,390 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/data/27efa5583/14ad1d08e122444a85de6bf78424cfac/FLAG32198cb6f [2018-10-27 06:10:30,402 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/data/27efa5583/14ad1d08e122444a85de6bf78424cfac [2018-10-27 06:10:30,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:30,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:30,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:30,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:30,411 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:30,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5a36fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30, skipping insertion in model container [2018-10-27 06:10:30,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:30,446 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:30,605 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:30,615 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:30,638 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:30,652 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:30,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30 WrapperNode [2018-10-27 06:10:30,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:30,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:30,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:30,654 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:30,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:30,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:30,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:30,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:30,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:30,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:30,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:30,719 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:30,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/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-10-27 06:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:10:31,369 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:31,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:31 BoogieIcfgContainer [2018-10-27 06:10:31,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:31,370 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:31,370 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:31,373 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:31,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:31,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:30" (1/3) ... [2018-10-27 06:10:31,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c95482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:31, skipping insertion in model container [2018-10-27 06:10:31,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:31,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (2/3) ... [2018-10-27 06:10:31,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c95482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:31, skipping insertion in model container [2018-10-27 06:10:31,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:31,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:31" (3/3) ... [2018-10-27 06:10:31,378 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum_false-unreach-call_true-termination.i [2018-10-27 06:10:31,421 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:31,422 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:31,422 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:31,422 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:31,422 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:31,423 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:31,423 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:31,423 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:31,423 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:31,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states. [2018-10-27 06:10:31,457 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 29 [2018-10-27 06:10:31,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:31,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:31,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-10-27 06:10:31,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:10:31,463 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:31,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states. [2018-10-27 06:10:31,467 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 29 [2018-10-27 06:10:31,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:31,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:31,467 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-10-27 06:10:31,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:10:31,472 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 7#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; 28#L33true assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 14#L7-4true [2018-10-27 06:10:31,473 INFO L795 eck$LassoCheckResult]: Loop: 14#L7-4true assume true; 5#L7-1true assume !!(init_nondet_~i~0 < ~N~0); 23#L8true SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 21#L8-1true havoc init_nondet_#t~nondet1; 18#L7-3true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 14#L7-4true [2018-10-27 06:10:31,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-10-27 06:10:31,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:31,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:31,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:31,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:31,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash 37372843, now seen corresponding path program 1 times [2018-10-27 06:10:31,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:31,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:31,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:31,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:31,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash 119442346, now seen corresponding path program 1 times [2018-10-27 06:10:31,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:31,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:31,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:31,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:31,717 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:10:31,901 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 06:10:32,110 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:10:32,119 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:32,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:32,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:32,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:32,121 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:32,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:32,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:32,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:32,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-10-27 06:10:32,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:32,122 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:32,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,704 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-27 06:10:32,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:32,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,132 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:33,135 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:33,137 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-10-27 06:10:33,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:33,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,146 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-10-27 06:10:33,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,152 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-10-27 06:10:33,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,154 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-10-27 06:10:33,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,157 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-10-27 06:10:33,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,172 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-10-27 06:10:33,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:33,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:33,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,180 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-10-27 06:10:33,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,194 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-10-27 06:10:33,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,198 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-10-27 06:10:33,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:33,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:33,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,203 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-10-27 06:10:33,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,208 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-10-27 06:10:33,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,212 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-10-27 06:10:33,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,217 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-10-27 06:10:33,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,220 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-10-27 06:10:33,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:33,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:33,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,235 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-10-27 06:10:33,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:33,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:33,244 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,247 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-10-27 06:10:33,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:33,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:33,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:33,275 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-10-27 06:10:33,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:33,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:33,357 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:33,414 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:10:33,414 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:10:33,416 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:33,417 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:33,418 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:33,418 INFO L519 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-10-27 06:10:33,444 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:10:33,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:33,522 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-10-27 06:10:33,523 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states. Second operand 4 states. [2018-10-27 06:10:33,672 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states.. Second operand 4 states. Result 161 states and 203 transitions. Complement of second has 7 states. [2018-10-27 06:10:33,674 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-10-27 06:10:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:10:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2018-10-27 06:10:33,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 138 transitions. Stem has 3 letters. Loop has 5 letters. [2018-10-27 06:10:33,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:33,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 138 transitions. Stem has 8 letters. Loop has 5 letters. [2018-10-27 06:10:33,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:33,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 138 transitions. Stem has 3 letters. Loop has 10 letters. [2018-10-27 06:10:33,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:33,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 203 transitions. [2018-10-27 06:10:33,689 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:33,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 50 states and 60 transitions. [2018-10-27 06:10:33,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-10-27 06:10:33,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-10-27 06:10:33,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 60 transitions. [2018-10-27 06:10:33,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:33,695 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-10-27 06:10:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 60 transitions. [2018-10-27 06:10:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-27 06:10:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 06:10:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-10-27 06:10:33,719 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-10-27 06:10:33,719 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-10-27 06:10:33,719 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:33,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 60 transitions. [2018-10-27 06:10:33,720 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:33,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:33,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:33,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:33,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:33,721 INFO L793 eck$LassoCheckResult]: Stem: 329#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 306#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; 307#L33 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 317#L7-4 assume true; 292#L7-1 assume !(init_nondet_~i~0 < ~N~0); 288#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; 283#L18-4 [2018-10-27 06:10:33,721 INFO L795 eck$LassoCheckResult]: Loop: 283#L18-4 assume true; 295#L18-1 assume !!(rangesum_~i~1 < ~N~0); 297#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 282#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 283#L18-4 [2018-10-27 06:10:33,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,722 INFO L82 PathProgramCache]: Analyzing trace with hash 889508721, now seen corresponding path program 1 times [2018-10-27 06:10:33,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:33,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:33,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:33,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:33,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:33,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:33,782 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:33,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1729096, now seen corresponding path program 1 times [2018-10-27 06:10:33,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:33,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:33,874 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:33,875 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:33,875 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:33,875 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:33,875 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:33,875 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:33,875 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:33,875 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:33,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2018-10-27 06:10:33,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:33,876 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:33,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,071 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:34,072 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:34,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:34,083 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:34,087 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:34,087 INFO L446 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_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:34,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:34,108 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:34,137 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:34,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:34,450 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:34,452 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:34,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:34,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:34,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:34,452 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:34,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:34,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:34,452 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:34,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2018-10-27 06:10:34,453 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:34,453 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:34,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,597 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:34,597 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:34,597 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-10-27 06:10:34,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:34,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:34,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:34,602 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:34,602 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-10-27 06:10:34,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:34,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:34,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:34,623 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:34,626 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:10:34,626 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:34,627 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:34,627 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:34,627 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:34,627 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -4*ULTIMATE.start_rangesum_~i~1 + 3*~N~0 Supporting invariants [] [2018-10-27 06:10:34,628 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:34,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:34,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:34,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:35,002 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-10-27 06:10:35,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 60 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-10-27 06:10:35,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 60 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 70 states and 84 transitions. Complement of second has 9 states. [2018-10-27 06:10:35,038 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-10-27 06:10:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:10:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-10-27 06:10:35,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 6 letters. Loop has 4 letters. [2018-10-27 06:10:35,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:35,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 10 letters. Loop has 4 letters. [2018-10-27 06:10:35,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:35,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 6 letters. Loop has 8 letters. [2018-10-27 06:10:35,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:35,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 84 transitions. [2018-10-27 06:10:35,042 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:35,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 60 states and 73 transitions. [2018-10-27 06:10:35,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-10-27 06:10:35,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-10-27 06:10:35,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 73 transitions. [2018-10-27 06:10:35,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:35,043 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 73 transitions. [2018-10-27 06:10:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 73 transitions. [2018-10-27 06:10:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-10-27 06:10:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 06:10:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2018-10-27 06:10:35,046 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 71 transitions. [2018-10-27 06:10:35,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:35,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:35,052 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 3 states. [2018-10-27 06:10:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:35,082 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-10-27 06:10:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:35,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 75 transitions. [2018-10-27 06:10:35,083 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:35,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 74 transitions. [2018-10-27 06:10:35,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-10-27 06:10:35,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-10-27 06:10:35,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 74 transitions. [2018-10-27 06:10:35,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:35,084 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-10-27 06:10:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 74 transitions. [2018-10-27 06:10:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-10-27 06:10:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 06:10:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-10-27 06:10:35,089 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-10-27 06:10:35,089 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-10-27 06:10:35,089 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:35,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 70 transitions. [2018-10-27 06:10:35,093 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:35,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:35,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:35,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:35,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:35,095 INFO L793 eck$LassoCheckResult]: Stem: 637#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 613#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; 614#L33 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 624#L7-4 assume true; 596#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 597#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 632#L8-1 havoc init_nondet_#t~nondet1; 626#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 625#L7-4 assume true; 595#L7-1 assume !(init_nondet_~i~0 < ~N~0); 590#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; 591#L18-4 assume true; 598#L18-1 [2018-10-27 06:10:35,095 INFO L795 eck$LassoCheckResult]: Loop: 598#L18-1 assume !!(rangesum_~i~1 < ~N~0); 600#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2); 611#L20 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L20 608#L20-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 580#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 581#L18-4 assume true; 598#L18-1 [2018-10-27 06:10:35,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:35,095 INFO L82 PathProgramCache]: Analyzing trace with hash -129962543, now seen corresponding path program 1 times [2018-10-27 06:10:35,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:35,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:35,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:35,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:35,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:35,130 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/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-10-27 06:10:35,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:35,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:35,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:35,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-27 06:10:35,221 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:35,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1807485623, now seen corresponding path program 1 times [2018-10-27 06:10:35,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:35,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:35,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:35,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:10:35,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:10:35,324 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-10-27 06:10:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:35,715 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-10-27 06:10:35,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:10:35,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2018-10-27 06:10:35,716 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:35,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 68 states and 79 transitions. [2018-10-27 06:10:35,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-10-27 06:10:35,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-10-27 06:10:35,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 79 transitions. [2018-10-27 06:10:35,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:35,718 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-10-27 06:10:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 79 transitions. [2018-10-27 06:10:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-10-27 06:10:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 06:10:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-10-27 06:10:35,722 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-10-27 06:10:35,723 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-10-27 06:10:35,723 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:35,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2018-10-27 06:10:35,723 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:35,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:35,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:35,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:35,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:35,724 INFO L793 eck$LassoCheckResult]: Stem: 810#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 784#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; 785#L33 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 795#L7-4 assume true; 796#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 813#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 812#L8-1 havoc init_nondet_#t~nondet1; 799#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 797#L7-4 assume true; 766#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 767#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 805#L8-1 havoc init_nondet_#t~nondet1; 806#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 811#L7-4 assume true; 765#L7-1 assume !(init_nondet_~i~0 < ~N~0); 760#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; 761#L18-4 assume true; 768#L18-1 [2018-10-27 06:10:35,724 INFO L795 eck$LassoCheckResult]: Loop: 768#L18-1 assume !!(rangesum_~i~1 < ~N~0); 770#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2); 782#L20 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L20 778#L20-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 750#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 751#L18-4 assume true; 768#L18-1 [2018-10-27 06:10:35,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:35,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1314406345, now seen corresponding path program 2 times [2018-10-27 06:10:35,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:35,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:35,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:35,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:35,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:35,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1807485623, now seen corresponding path program 2 times [2018-10-27 06:10:35,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:35,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:35,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:35,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:35,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1803070337, now seen corresponding path program 1 times [2018-10-27 06:10:35,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:35,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:35,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:35,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 06:10:35,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:35,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:10:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:10:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:10:36,114 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-10-27 06:10:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:36,173 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-10-27 06:10:36,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:10:36,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 87 transitions. [2018-10-27 06:10:36,175 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:36,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 75 states and 85 transitions. [2018-10-27 06:10:36,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-10-27 06:10:36,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-10-27 06:10:36,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 85 transitions. [2018-10-27 06:10:36,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:36,176 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-10-27 06:10:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 85 transitions. [2018-10-27 06:10:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-27 06:10:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 06:10:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-10-27 06:10:36,180 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-10-27 06:10:36,180 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-10-27 06:10:36,180 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:36,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 82 transitions. [2018-10-27 06:10:36,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:36,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:36,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:36,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,181 INFO L793 eck$LassoCheckResult]: Stem: 960#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 933#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; 934#L33 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 943#L7-4 assume true; 916#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 917#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 953#L8-1 havoc init_nondet_#t~nondet1; 947#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 944#L7-4 assume true; 945#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 965#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 964#L8-1 havoc init_nondet_#t~nondet1; 963#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 962#L7-4 assume true; 915#L7-1 assume !(init_nondet_~i~0 < ~N~0); 910#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; 911#L18-4 assume true; 921#L18-1 assume !!(rangesum_~i~1 < ~N~0); 922#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 957#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 969#L18-4 assume true; 918#L18-1 [2018-10-27 06:10:36,181 INFO L795 eck$LassoCheckResult]: Loop: 918#L18-1 assume !!(rangesum_~i~1 < ~N~0); 920#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2); 931#L20 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L20 928#L20-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 902#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 903#L18-4 assume true; 918#L18-1 [2018-10-27 06:10:36,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash -448799134, now seen corresponding path program 1 times [2018-10-27 06:10:36,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1807485623, now seen corresponding path program 3 times [2018-10-27 06:10:36,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,232 INFO L82 PathProgramCache]: Analyzing trace with hash -665199528, now seen corresponding path program 1 times [2018-10-27 06:10:36,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 06:10:36,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:36,536 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:36,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 06:10:36,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:36,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-27 06:10:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:10:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:10:36,722 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-10-27 06:10:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:36,911 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-10-27 06:10:36,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:10:36,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 101 transitions. [2018-10-27 06:10:36,913 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2018-10-27 06:10:36,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 89 states and 99 transitions. [2018-10-27 06:10:36,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-10-27 06:10:36,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-10-27 06:10:36,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 99 transitions. [2018-10-27 06:10:36,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:36,914 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-10-27 06:10:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 99 transitions. [2018-10-27 06:10:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-10-27 06:10:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-27 06:10:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-10-27 06:10:36,917 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-10-27 06:10:36,917 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-10-27 06:10:36,917 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:36,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 94 transitions. [2018-10-27 06:10:36,918 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:36,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:36,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:36,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,923 INFO L793 eck$LassoCheckResult]: Stem: 1218#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1189#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; 1190#L33 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1199#L7-4 assume true; 1171#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 1172#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 1209#L8-1 havoc init_nondet_#t~nondet1; 1203#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1200#L7-4 assume true; 1201#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 1224#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 1223#L8-1 havoc init_nondet_#t~nondet1; 1222#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1221#L7-4 assume true; 1170#L7-1 assume !(init_nondet_~i~0 < ~N~0); 1165#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; 1166#L18-4 assume true; 1176#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1177#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 1159#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1160#L18-4 assume true; 1202#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1214#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 1215#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1232#L18-4 assume true; 1173#L18-1 [2018-10-27 06:10:36,923 INFO L795 eck$LassoCheckResult]: Loop: 1173#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1175#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2); 1187#L20 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L20 1183#L20-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1157#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1158#L18-4 assume true; 1173#L18-1 [2018-10-27 06:10:36,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1804896379, now seen corresponding path program 2 times [2018-10-27 06:10:36,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1807485623, now seen corresponding path program 4 times [2018-10-27 06:10:36,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:36,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1568853937, now seen corresponding path program 2 times [2018-10-27 06:10:36,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:36,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 06:10:37,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:37,145 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:37,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:10:37,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:10:37,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:37,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:37,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:37,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-10-27 06:10:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 06:10:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-10-27 06:10:37,438 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. cyclomatic complexity: 16 Second operand 15 states. [2018-10-27 06:10:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:37,862 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2018-10-27 06:10:37,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:10:37,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 160 transitions. [2018-10-27 06:10:37,864 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2018-10-27 06:10:37,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 134 states and 147 transitions. [2018-10-27 06:10:37,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-10-27 06:10:37,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-10-27 06:10:37,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 147 transitions. [2018-10-27 06:10:37,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:37,865 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 147 transitions. [2018-10-27 06:10:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 147 transitions. [2018-10-27 06:10:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2018-10-27 06:10:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-27 06:10:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2018-10-27 06:10:37,873 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-10-27 06:10:37,873 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-10-27 06:10:37,873 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:37,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 143 transitions. [2018-10-27 06:10:37,874 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2018-10-27 06:10:37,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:37,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:37,877 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-27 06:10:37,877 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:37,878 INFO L793 eck$LassoCheckResult]: Stem: 1576#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1540#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; 1541#L33 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1554#L7-4 assume true; 1555#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 1615#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 1612#L8-1 havoc init_nondet_#t~nondet1; 1559#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1556#L7-4 assume true; 1557#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 1616#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 1613#L8-1 havoc init_nondet_#t~nondet1; 1611#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1610#L7-4 assume true; 1522#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 1523#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 1567#L8-1 havoc init_nondet_#t~nondet1; 1568#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1600#L7-4 assume true; 1598#L7-1 assume !(init_nondet_~i~0 < ~N~0); 1594#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; 1592#L18-4 assume true; 1526#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1527#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 1508#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1509#L18-4 assume true; 1558#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1588#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 1582#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1585#L18-4 assume true; 1583#L18-1 [2018-10-27 06:10:37,878 INFO L795 eck$LassoCheckResult]: Loop: 1583#L18-1 assume !!(rangesum_~i~1 < ~N~0); 1580#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2); 1538#L20 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L20 1533#L20-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1534#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1586#L18-4 assume true; 1583#L18-1 [2018-10-27 06:10:37,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash -293328509, now seen corresponding path program 3 times [2018-10-27 06:10:37,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:37,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:37,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:37,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:37,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1807485623, now seen corresponding path program 5 times [2018-10-27 06:10:37,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:37,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:37,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:37,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:37,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:37,912 INFO L82 PathProgramCache]: Analyzing trace with hash 598182585, now seen corresponding path program 3 times [2018-10-27 06:10:37,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:37,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:37,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:37,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,183 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 06:10:38,460 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-10-27 06:10:38,751 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 109 [2018-10-27 06:10:38,811 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:38,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:38,811 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:38,811 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:38,811 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:38,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:38,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:38,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:38,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-10-27 06:10:38,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:38,812 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:38,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:39,347 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:39,348 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:39,348 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-10-27 06:10:39,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:39,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:39,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:39,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,355 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-10-27 06:10:39,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:39,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:39,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:39,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,357 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-10-27 06:10:39,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:39,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:39,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:39,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,358 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-10-27 06:10:39,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:39,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:39,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:39,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,364 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-10-27 06:10:39,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:39,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:39,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:39,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,365 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-10-27 06:10:39,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:39,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:39,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,377 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-10-27 06:10:39,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:39,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:39,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:39,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,378 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-10-27 06:10:39,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:39,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:39,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,393 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-10-27 06:10:39,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:39,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:39,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:39,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,394 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-10-27 06:10:39,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:39,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:39,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,397 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-10-27 06:10:39,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:39,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:39,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,412 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-10-27 06:10:39,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:39,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:39,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,415 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-10-27 06:10:39,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:39,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:39,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,428 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-10-27 06:10:39,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,429 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:39,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,430 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:39,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:39,440 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,440 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-10-27 06:10:39,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:39,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:39,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:39,447 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-10-27 06:10:39,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:39,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:39,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:39,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:39,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:39,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:39,471 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:39,492 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:10:39,492 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:39,492 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:39,493 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:39,493 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:39,493 INFO L519 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-10-27 06:10:39,584 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-10-27 06:10:39,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:39,800 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-10-27 06:10:39,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 130 states and 143 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-10-27 06:10:39,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 130 states and 143 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 171 states and 191 transitions. Complement of second has 7 states. [2018-10-27 06:10:39,824 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-10-27 06:10:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:10:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-10-27 06:10:39,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 30 letters. Loop has 6 letters. [2018-10-27 06:10:39,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 36 letters. Loop has 6 letters. [2018-10-27 06:10:39,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 30 letters. Loop has 12 letters. [2018-10-27 06:10:39,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 191 transitions. [2018-10-27 06:10:39,828 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:39,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 133 states and 147 transitions. [2018-10-27 06:10:39,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-10-27 06:10:39,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2018-10-27 06:10:39,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 147 transitions. [2018-10-27 06:10:39,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:39,830 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-10-27 06:10:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 147 transitions. [2018-10-27 06:10:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-10-27 06:10:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-27 06:10:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2018-10-27 06:10:39,836 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 146 transitions. [2018-10-27 06:10:39,836 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 146 transitions. [2018-10-27 06:10:39,836 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:10:39,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 146 transitions. [2018-10-27 06:10:39,837 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-10-27 06:10:39,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:39,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:39,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:39,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:39,840 INFO L793 eck$LassoCheckResult]: Stem: 2023#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1990#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; 1991#L33 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 2001#L7-4 assume true; 2002#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 2083#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 2081#L8-1 havoc init_nondet_#t~nondet1; 2007#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2003#L7-4 assume true; 1976#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 1977#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 2015#L8-1 havoc init_nondet_#t~nondet1; 2016#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2078#L7-4 assume true; 2077#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 2082#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 2080#L8-1 havoc init_nondet_#t~nondet1; 2079#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2076#L7-4 assume true; 1975#L7-1 assume !(init_nondet_~i~0 < ~N~0); 1970#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; 1971#L18-4 assume true; 2004#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2086#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 2075#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2005#L18-4 assume true; 2006#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2091#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 1962#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1963#L18-4 assume true; 2059#L18-1 assume !(rangesum_~i~1 < ~N~0); 1998#L18-5 assume rangesum_~cnt~0 != 0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 1973#L27 main_#t~ret5 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 1974#L43 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L43 1992#L43-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 1993#L43-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L43-2 2019#L43-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L43-3 2017#L43-4 havoc main_#t~mem7; 2013#L43-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L43-5 2010#L43-6 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; 2011#L18-10 assume true; 1994#L18-7 assume !!(rangesum_~i~1 < ~N~0); 1995#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 2014#L18-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2021#L18-10 assume true; 2068#L18-7 assume !!(rangesum_~i~1 < ~N~0); 2066#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 1982#L18-9 [2018-10-27 06:10:39,840 INFO L795 eck$LassoCheckResult]: Loop: 1982#L18-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2063#L18-10 assume true; 2062#L18-7 assume !!(rangesum_~i~1 < ~N~0); 2061#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 1982#L18-9 [2018-10-27 06:10:39,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash 595600357, now seen corresponding path program 1 times [2018-10-27 06:10:39,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:39,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,851 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:39,852 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:39,852 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:39,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-27 06:10:39,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:39,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:39,960 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:39,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,961 INFO L82 PathProgramCache]: Analyzing trace with hash 3218586, now seen corresponding path program 1 times [2018-10-27 06:10:39,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:39,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:39,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:39,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,014 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:40,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:40,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:40,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:40,015 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:40,015 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:40,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:40,015 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:40,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration8_Loop [2018-10-27 06:10:40,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:40,015 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:40,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,146 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:40,146 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:40,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:40,149 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b5745b0-c6dd-4692-ae98-f40cfdf593e3/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:40,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:40,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:40,778 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:40,780 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:40,780 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:40,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:40,780 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:40,780 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:40,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:40,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:40,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:40,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration8_Loop [2018-10-27 06:10:40,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:40,780 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:40,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,845 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:40,845 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:40,846 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-10-27 06:10:40,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:40,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:40,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:40,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:40,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:40,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:40,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:40,848 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:40,849 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:10:40,849 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:40,850 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:40,850 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:40,850 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:40,850 INFO L519 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-10-27 06:10:40,850 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:41,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:41,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:41,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:41,243 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-10-27 06:10:41,243 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 146 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-10-27 06:10:41,269 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 146 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 167 states and 187 transitions. Complement of second has 7 states. [2018-10-27 06:10:41,270 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-10-27 06:10:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:10:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-10-27 06:10:41,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 47 letters. Loop has 4 letters. [2018-10-27 06:10:41,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:41,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 51 letters. Loop has 4 letters. [2018-10-27 06:10:41,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:41,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 47 letters. Loop has 8 letters. [2018-10-27 06:10:41,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:41,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 187 transitions. [2018-10-27 06:10:41,273 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-10-27 06:10:41,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 138 states and 154 transitions. [2018-10-27 06:10:41,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-10-27 06:10:41,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2018-10-27 06:10:41,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 154 transitions. [2018-10-27 06:10:41,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:41,274 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 154 transitions. [2018-10-27 06:10:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 154 transitions. [2018-10-27 06:10:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-27 06:10:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-27 06:10:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2018-10-27 06:10:41,284 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 153 transitions. [2018-10-27 06:10:41,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:41,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:41,284 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand 3 states. [2018-10-27 06:10:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:41,310 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2018-10-27 06:10:41,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:41,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 208 transitions. [2018-10-27 06:10:41,312 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 28 [2018-10-27 06:10:41,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 208 transitions. [2018-10-27 06:10:41,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2018-10-27 06:10:41,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2018-10-27 06:10:41,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 208 transitions. [2018-10-27 06:10:41,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:41,313 INFO L705 BuchiCegarLoop]: Abstraction has 186 states and 208 transitions. [2018-10-27 06:10:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 208 transitions. [2018-10-27 06:10:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2018-10-27 06:10:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-27 06:10:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2018-10-27 06:10:41,321 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 171 transitions. [2018-10-27 06:10:41,321 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 171 transitions. [2018-10-27 06:10:41,321 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:10:41,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 171 transitions. [2018-10-27 06:10:41,322 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-10-27 06:10:41,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:41,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:41,334 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:41,334 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:41,334 INFO L793 eck$LassoCheckResult]: Stem: 2975#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2930#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; 2931#L33 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 2943#L7-4 assume true; 2944#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 3010#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 2962#L8-1 havoc init_nondet_#t~nondet1; 2951#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2945#L7-4 assume true; 2946#L7-1 assume !!(init_nondet_~i~0 < ~N~0); 2966#L8 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L8 2967#L8-1 havoc init_nondet_#t~nondet1; 2990#L7-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2991#L7-4 assume true; 2912#L7-1 assume !(init_nondet_~i~0 < ~N~0); 2913#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; 3025#L18-4 assume true; 3024#L18-1 assume !!(rangesum_~i~1 < ~N~0); 2969#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 2901#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2902#L18-4 assume true; 3015#L18-1 assume !!(rangesum_~i~1 < ~N~0); 3016#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 3023#L18-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3022#L18-4 assume true; 3021#L18-1 assume !(rangesum_~i~1 < ~N~0); 3020#L18-5 assume !(rangesum_~cnt~0 != 0);rangesum_#res := 0; 3019#L27 main_#t~ret5 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 3018#L43 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L43 3017#L43-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 2973#L43-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L43-2 2968#L43-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L43-3 2963#L43-4 havoc main_#t~mem7; 2957#L43-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L43-5 2953#L43-6 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; 2954#L18-10 assume true; 3008#L18-7 assume !!(rangesum_~i~1 < ~N~0); 3009#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 2970#L18-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2971#L18-10 assume true; 3011#L18-7 assume !!(rangesum_~i~1 < ~N~0); 2958#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && ~N~0 % 2 != 0 then ~N~0 / 2 + 1 else ~N~0 / 2)); 2959#L18-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2964#L18-10 assume true; 2934#L18-7 assume !(rangesum_~i~1 < ~N~0); 2935#L18-11 assume !(rangesum_~cnt~0 != 0);rangesum_#res := 0; 2905#L27-1 main_#t~ret8 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 2906#L45 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L45 2938#L45-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; 2939#L46-4 [2018-10-27 06:10:41,335 INFO L795 eck$LassoCheckResult]: Loop: 2939#L46-4 assume true; 2974#L46-1 assume !!(main_~i~2 < ~N~0 - 1); 2978#L47 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~2 + 1) * 4, 4); srcloc: L47 3002#L47-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~2 * 4, 4); srcloc: L47-1 2940#L47-2 havoc main_#t~mem11; 2941#L46-3 main_#t~post10 := main_~i~2;main_~i~2 := main_#t~post10 + 1;havoc main_#t~post10; 2939#L46-4 [2018-10-27 06:10:41,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 969648326, now seen corresponding path program 1 times [2018-10-27 06:10:41,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:41,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:41,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:41,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:41,367 INFO L82 PathProgramCache]: Analyzing trace with hash -710565783, now seen corresponding path program 1 times [2018-10-27 06:10:41,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:41,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:41,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:41,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:41,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:41,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash 389996910, now seen corresponding path program 1 times [2018-10-27 06:10:41,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:41,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:41,880 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 163 [2018-10-27 06:10:42,200 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2018-10-27 06:10:42,202 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:42,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:42,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:42,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:42,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:42,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:42,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:42,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:42,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-10-27 06:10:42,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:42,203 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:42,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,249 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:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) 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-10-27 06:10:42,252 INFO L168 Benchmark]: Toolchain (without parser) took 11846.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 961.2 MB in the beginning and 889.2 MB in the end (delta: 71.9 MB). Peak memory consumption was 267.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:42,252 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:42,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.81 ms. Allocated memory is still 1.0 GB. Free memory was 961.2 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:42,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.83 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:42,253 INFO L168 Benchmark]: Boogie Preprocessor took 24.11 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:42,253 INFO L168 Benchmark]: RCFGBuilder took 650.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:42,254 INFO L168 Benchmark]: BuchiAutomizer took 10881.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 889.2 MB in the end (delta: 236.5 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:42,260 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.81 ms. Allocated memory is still 1.0 GB. Free memory was 961.2 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.83 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.11 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 650.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10881.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 889.2 MB in the end (delta: 236.5 MB). Peak memory consumption was 277.4 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...