./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/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_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/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_ba689c77-df0a-470a-809e-ad6a2706c39c/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-aa41828 [2018-11-23 14:04:17,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:04:17,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:04:17,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:04:17,286 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:04:17,286 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:04:17,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:04:17,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:04:17,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:04:17,290 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:04:17,291 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:04:17,291 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:04:17,292 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:04:17,293 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:04:17,294 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:04:17,294 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:04:17,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:04:17,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:04:17,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:04:17,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:04:17,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:04:17,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:04:17,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:04:17,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:04:17,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:04:17,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:04:17,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:04:17,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:04:17,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:04:17,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:04:17,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:04:17,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:04:17,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:04:17,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:04:17,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:04:17,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:04:17,310 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 14:04:17,322 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:04:17,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:04:17,323 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:04:17,323 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:04:17,323 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:04:17,323 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:04:17,324 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:04:17,324 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:04:17,325 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:04:17,325 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:04:17,325 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:04:17,325 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:04:17,325 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:04:17,325 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:04:17,326 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:04:17,326 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:04:17,326 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:04:17,326 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:04:17,326 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:04:17,326 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:04:17,327 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:04:17,327 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:04:17,327 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:04:17,327 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:04:17,327 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:04:17,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:04:17,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:04:17,330 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:04:17,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:04:17,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:04:17,330 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:04:17,331 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:04:17,331 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_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 279fae57395782089eff32ec1396d1726d808c7f [2018-11-23 14:04:17,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:04:17,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:04:17,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:04:17,371 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:04:17,371 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:04:17,371 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-23 14:04:17,422 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/data/b1581be46/f95c88fe605945729ebf1c7f19c90e96/FLAG07a0cc3cd [2018-11-23 14:04:17,777 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:04:17,778 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-23 14:04:17,784 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/data/b1581be46/f95c88fe605945729ebf1c7f19c90e96/FLAG07a0cc3cd [2018-11-23 14:04:18,186 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/data/b1581be46/f95c88fe605945729ebf1c7f19c90e96 [2018-11-23 14:04:18,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:04:18,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:04:18,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:04:18,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:04:18,195 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:04:18,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c28d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18, skipping insertion in model container [2018-11-23 14:04:18,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:04:18,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:04:18,355 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:04:18,363 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:04:18,381 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:04:18,394 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:04:18,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18 WrapperNode [2018-11-23 14:04:18,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:04:18,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:04:18,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:04:18,395 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:04:18,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:04:18,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:04:18,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:04:18,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:04:18,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... [2018-11-23 14:04:18,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:04:18,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:04:18,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:04:18,502 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:04:18,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:04:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:04:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:04:18,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:04:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:04:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:04:18,787 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:04:18,787 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-23 14:04:18,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:04:18 BoogieIcfgContainer [2018-11-23 14:04:18,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:04:18,788 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:04:18,788 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:04:18,791 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:04:18,793 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:04:18,793 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:04:18" (1/3) ... [2018-11-23 14:04:18,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4932a66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:04:18, skipping insertion in model container [2018-11-23 14:04:18,794 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:04:18,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:18" (2/3) ... [2018-11-23 14:04:18,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4932a66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:04:18, skipping insertion in model container [2018-11-23 14:04:18,795 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:04:18,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:04:18" (3/3) ... [2018-11-23 14:04:18,796 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum_false-unreach-call_true-termination.i [2018-11-23 14:04:18,835 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:04:18,835 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:04:18,835 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:04:18,835 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:04:18,835 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:04:18,836 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:04:18,836 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:04:18,836 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:04:18,836 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:04:18,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-23 14:04:18,868 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-23 14:04:18,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:18,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:18,875 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 14:04:18,875 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:04:18,875 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:04:18,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-23 14:04:18,877 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-23 14:04:18,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:18,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:18,877 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 14:04:18,877 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:04:18,883 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#L-1true 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; 30#L33true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);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; 17#L7-3true [2018-11-23 14:04:18,883 INFO L796 eck$LassoCheckResult]: Loop: 17#L7-3true assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 6#L7-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 17#L7-3true [2018-11-23 14:04:18,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-23 14:04:18,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:18,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:18,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:18,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:18,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:18,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2018-11-23 14:04:18,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:18,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:18,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:18,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2018-11-23 14:04:18,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:18,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:18,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:18,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:18,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:19,182 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:04:19,183 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:04:19,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:04:19,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:04:19,183 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:04:19,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:19,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:04:19,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:04:19,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 14:04:19,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:04:19,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:04:19,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:19,576 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:04:19,580 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:04:19,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:19,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:19,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:19,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:19,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:19,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:19,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:19,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:19,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:19,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:19,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:19,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:19,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:19,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:19,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:19,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:19,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:19,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:19,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:19,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:19,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:19,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:19,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:19,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:19,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:19,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:19,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:19,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-11-23 14:04:19,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:19,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:19,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:19,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:19,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:19,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:19,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:19,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:19,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:19,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:19,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:19,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:19,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:19,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:19,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:19,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:19,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:19,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:19,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:19,604 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:04:19,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:19,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:19,607 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:04:19,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:19,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:19,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:19,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:19,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:19,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:19,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:19,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:19,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:19,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:19,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:19,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:19,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:19,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:19,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:19,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:19,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:04:19,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:19,688 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:04:19,728 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 14:04:19,728 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 14:04:19,730 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:04:19,733 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:04:19,733 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:04:19,734 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, ~N~0) = -1*ULTIMATE.start_init_nondet_~i~0 + 1*~N~0 Supporting invariants [] [2018-11-23 14:04:19,750 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 14:04:19,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:19,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:19,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:04:19,818 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:04:19,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2018-11-23 14:04:19,911 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 86 states and 130 transitions. Complement of second has 7 states. [2018-11-23 14:04:19,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 14:04:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:04:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-23 14:04:19,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 14:04:19,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:19,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 14:04:19,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:19,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-23 14:04:19,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:19,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 130 transitions. [2018-11-23 14:04:19,922 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 14:04:19,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 23 states and 33 transitions. [2018-11-23 14:04:19,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 14:04:19,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-23 14:04:19,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2018-11-23 14:04:19,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:04:19,928 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-23 14:04:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2018-11-23 14:04:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 14:04:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 14:04:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2018-11-23 14:04:19,950 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-23 14:04:19,950 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-23 14:04:19,950 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:04:19,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2018-11-23 14:04:19,951 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 14:04:19,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:19,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:19,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 14:04:19,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:04:19,952 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 187#L-1 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; 188#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);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; 192#L7-3 assume !(init_nondet_~i~0 < ~N~0); 178#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 170#L18-3 [2018-11-23 14:04:19,952 INFO L796 eck$LassoCheckResult]: Loop: 170#L18-3 assume !!(rangesum_~i~1 < ~N~0); 172#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 181#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 170#L18-3 [2018-11-23 14:04:19,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2018-11-23 14:04:19,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:19,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:19,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:19,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:19,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:04:19,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:04:19,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:04:19,991 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:04:19,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2018-11-23 14:04:19,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:19,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:19,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:20,018 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:04:20,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:04:20,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:04:20,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:04:20,019 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 14:04:20,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:20,019 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:04:20,019 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:04:20,019 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-23 14:04:20,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:04:20,019 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:04:20,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-11-23 14:04:20,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-11-23 14:04:20,099 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:04:20,100 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:20,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:04:20,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:04:20,108 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 14:04:20,108 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post2=0} Honda state: {ULTIMATE.start_rangesum_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:20,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:04:20,127 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:20,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 14:04:20,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:04:20,360 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 14:04:20,362 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:04:20,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:04:20,362 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:04:20,362 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:04:20,362 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:04:20,362 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:20,362 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:04:20,362 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:04:20,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-23 14:04:20,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:04:20,362 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:04:20,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:20,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:20,425 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:04:20,425 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:04:20,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:20,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:20,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:20,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:20,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:20,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:20,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:20,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:20,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:20,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:20,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:20,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:20,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:20,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:20,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:20,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:20,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:20,433 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:04:20,437 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 14:04:20,437 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 14:04:20,437 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:04:20,437 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 14:04:20,437 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:04:20,438 INFO L520 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-11-23 14:04:20,438 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 14:04:20,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:20,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:20,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:04:20,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 14:04:20,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-23 14:04:20,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 34 states and 53 transitions. Complement of second has 9 states. [2018-11-23 14:04:20,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 14:04:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 14:04:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-23 14:04:20,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 14:04:20,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:20,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 14:04:20,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:20,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 14:04:20,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:20,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2018-11-23 14:04:20,549 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 14:04:20,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2018-11-23 14:04:20,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 14:04:20,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 14:04:20,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2018-11-23 14:04:20,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:04:20,551 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2018-11-23 14:04:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2018-11-23 14:04:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 14:04:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 14:04:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2018-11-23 14:04:20,555 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-11-23 14:04:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:04:20,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:04:20,558 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2018-11-23 14:04:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:04:20,583 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2018-11-23 14:04:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:04:20,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2018-11-23 14:04:20,584 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 14:04:20,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2018-11-23 14:04:20,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 14:04:20,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 14:04:20,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2018-11-23 14:04:20,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:04:20,585 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-11-23 14:04:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2018-11-23 14:04:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 14:04:20,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 14:04:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2018-11-23 14:04:20,588 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-11-23 14:04:20,588 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-11-23 14:04:20,588 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:04:20,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2018-11-23 14:04:20,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 14:04:20,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:20,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:20,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:04:20,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:04:20,589 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 359#L-1 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; 360#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);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; 364#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 347#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 348#L7-3 assume !(init_nondet_~i~0 < ~N~0); 349#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 350#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2018-11-23 14:04:20,590 INFO L796 eck$LassoCheckResult]: Loop: 339#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 351#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 337#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2018-11-23 14:04:20,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2018-11-23 14:04:20,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:20,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:04:20,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:04:20,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:04:20,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:20,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:04:20,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:04:20,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 14:04:20,727 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:04:20,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2018-11-23 14:04:20,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:20,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:20,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:20,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:20,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:04:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:04:20,846 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2018-11-23 14:04:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:04:20,911 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2018-11-23 14:04:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:04:20,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2018-11-23 14:04:20,913 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 14:04:20,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2018-11-23 14:04:20,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 14:04:20,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 14:04:20,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2018-11-23 14:04:20,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:04:20,914 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2018-11-23 14:04:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2018-11-23 14:04:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 14:04:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 14:04:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-11-23 14:04:20,916 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-23 14:04:20,916 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-23 14:04:20,916 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:04:20,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2018-11-23 14:04:20,917 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 14:04:20,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:20,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:20,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 14:04:20,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:04:20,918 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 450#L-1 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; 451#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);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; 455#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 456#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 457#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 437#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 438#L7-3 assume !(init_nondet_~i~0 < ~N~0); 439#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 440#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2018-11-23 14:04:20,918 INFO L796 eck$LassoCheckResult]: Loop: 430#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 442#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 428#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2018-11-23 14:04:20,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:20,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2018-11-23 14:04:20,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:20,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:20,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:20,936 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2018-11-23 14:04:20,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:20,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:20,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:20,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:20,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2018-11-23 14:04:20,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:04:20,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:04:20,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:04:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:04:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:04:21,044 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-11-23 14:04:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:04:21,113 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-23 14:04:21,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:04:21,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-11-23 14:04:21,115 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 14:04:21,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2018-11-23 14:04:21,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 14:04:21,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 14:04:21,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2018-11-23 14:04:21,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:04:21,116 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-23 14:04:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2018-11-23 14:04:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 14:04:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:04:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-23 14:04:21,119 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-23 14:04:21,119 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-23 14:04:21,119 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 14:04:21,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2018-11-23 14:04:21,119 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 14:04:21,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:21,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:21,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:04:21,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:04:21,120 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 531#L-1 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; 532#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);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; 538#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 516#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 517#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 540#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 541#L7-3 assume !(init_nondet_~i~0 < ~N~0); 518#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 508#L18-3 assume !!(rangesum_~i~1 < ~N~0); 509#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 529#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 542#L18-3 assume !!(rangesum_~i~1 < ~N~0); 528#L19 [2018-11-23 14:04:21,121 INFO L796 eck$LassoCheckResult]: Loop: 528#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 521#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 522#L18-3 assume !!(rangesum_~i~1 < ~N~0); 528#L19 [2018-11-23 14:04:21,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:21,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2018-11-23 14:04:21,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:21,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:21,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:21,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:21,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2018-11-23 14:04:21,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:21,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:21,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:21,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:21,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2018-11-23 14:04:21,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:21,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:04:21,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:04:21,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:04:21,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:21,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:04:21,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:04:21,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2018-11-23 14:04:21,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 14:04:21,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:04:21,407 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-23 14:04:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:04:21,664 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2018-11-23 14:04:21,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 14:04:21,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 95 transitions. [2018-11-23 14:04:21,666 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2018-11-23 14:04:21,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 85 transitions. [2018-11-23 14:04:21,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-23 14:04:21,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-23 14:04:21,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2018-11-23 14:04:21,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:04:21,667 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 85 transitions. [2018-11-23 14:04:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2018-11-23 14:04:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-11-23 14:04:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 14:04:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-11-23 14:04:21,671 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-23 14:04:21,671 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-23 14:04:21,671 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 14:04:21,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 82 transitions. [2018-11-23 14:04:21,672 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-23 14:04:21,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:21,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:21,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 14:04:21,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:04:21,673 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 728#L-1 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; 729#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);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; 736#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 712#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 713#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 740#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 766#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 765#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 764#L7-3 assume !(init_nondet_~i~0 < ~N~0); 763#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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-3 assume !!(rangesum_~i~1 < ~N~0); 725#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 717#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 718#L18-3 assume !!(rangesum_~i~1 < ~N~0); 754#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 751#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 749#L18-3 assume !!(rangesum_~i~1 < ~N~0); 750#L19 [2018-11-23 14:04:21,673 INFO L796 eck$LassoCheckResult]: Loop: 750#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 760#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 759#L18-3 assume !!(rangesum_~i~1 < ~N~0); 750#L19 [2018-11-23 14:04:21,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:21,674 INFO L82 PathProgramCache]: Analyzing trace with hash -194268853, now seen corresponding path program 2 times [2018-11-23 14:04:21,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:21,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:21,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:21,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:21,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:21,692 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2018-11-23 14:04:21,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:21,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:21,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:21,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2142422100, now seen corresponding path program 2 times [2018-11-23 14:04:21,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:21,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:21,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:21,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:04:21,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:04:21,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:04:21,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 14:04:21,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:04:21,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:04:21,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:04:21,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:04:21,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-11-23 14:04:21,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 14:04:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-23 14:04:21,946 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. cyclomatic complexity: 21 Second operand 19 states. [2018-11-23 14:04:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:04:22,222 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-11-23 14:04:22,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 14:04:22,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 141 transitions. [2018-11-23 14:04:22,223 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2018-11-23 14:04:22,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 125 transitions. [2018-11-23 14:04:22,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-23 14:04:22,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-23 14:04:22,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 125 transitions. [2018-11-23 14:04:22,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:04:22,225 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 125 transitions. [2018-11-23 14:04:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 125 transitions. [2018-11-23 14:04:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2018-11-23 14:04:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 14:04:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2018-11-23 14:04:22,229 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2018-11-23 14:04:22,229 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2018-11-23 14:04:22,229 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 14:04:22,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 109 transitions. [2018-11-23 14:04:22,230 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-23 14:04:22,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:22,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:22,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 14:04:22,231 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:04:22,231 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1019#L-1 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; 1020#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);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; 1027#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1004#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1005#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1030#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1061#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1060#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1058#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1057#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1056#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1055#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 1054#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1017#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1010#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1011#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1050#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1048#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1045#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1046#L19 [2018-11-23 14:04:22,231 INFO L796 eck$LassoCheckResult]: Loop: 1046#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1049#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1047#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1046#L19 [2018-11-23 14:04:22,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:22,231 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 3 times [2018-11-23 14:04:22,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:22,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:22,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:22,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:22,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:22,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:22,251 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2018-11-23 14:04:22,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:22,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:22,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:22,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:22,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:22,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 3 times [2018-11-23 14:04:22,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:22,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:22,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:04:22,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:04:22,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba689c77-df0a-470a-809e-ad6a2706c39c/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:04:22,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 14:04:22,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 14:04:22,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:04:22,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 14:04:22,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:04:22,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-11-23 14:04:22,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 14:04:22,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-11-23 14:04:22,555 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. cyclomatic complexity: 25 Second operand 17 states. [2018-11-23 14:04:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:04:23,243 INFO L93 Difference]: Finished difference Result 245 states and 301 transitions. [2018-11-23 14:04:23,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 14:04:23,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 301 transitions. [2018-11-23 14:04:23,245 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 41 [2018-11-23 14:04:23,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 231 states and 286 transitions. [2018-11-23 14:04:23,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2018-11-23 14:04:23,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2018-11-23 14:04:23,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 286 transitions. [2018-11-23 14:04:23,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:04:23,249 INFO L705 BuchiCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-11-23 14:04:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 286 transitions. [2018-11-23 14:04:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 133. [2018-11-23 14:04:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 14:04:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2018-11-23 14:04:23,256 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-11-23 14:04:23,256 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-11-23 14:04:23,256 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 14:04:23,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 163 transitions. [2018-11-23 14:04:23,257 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2018-11-23 14:04:23,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:23,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:23,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2018-11-23 14:04:23,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:04:23,258 INFO L794 eck$LassoCheckResult]: Stem: 1502#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1498#L-1 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; 1499#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);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; 1505#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1506#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1507#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1484#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1485#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1509#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1533#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1532#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1531#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1530#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1529#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1528#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 1527#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1526#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1525#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1524#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1523#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1522#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1521#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1520#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1516#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1519#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1573#L19 [2018-11-23 14:04:23,258 INFO L796 eck$LassoCheckResult]: Loop: 1573#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1574#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1571#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1573#L19 [2018-11-23 14:04:23,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:23,259 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 4 times [2018-11-23 14:04:23,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:23,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:23,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:23,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:23,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:23,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2018-11-23 14:04:23,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:23,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:23,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:23,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:23,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:23,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 4 times [2018-11-23 14:04:23,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:23,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:23,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:23,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:23,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:23,806 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 124 [2018-11-23 14:04:23,884 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:04:23,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:04:23,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:04:23,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:04:23,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:04:23,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:23,884 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:04:23,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:04:23,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-11-23 14:04:23,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:04:23,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:04:23,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:23,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,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-11-23 14:04:24,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,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-11-23 14:04:24,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,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-11-23 14:04:24,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-11-23 14:04:24,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,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-11-23 14:04:24,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,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-11-23 14:04:24,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,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-11-23 14:04:24,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:24,294 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:04:24,294 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:04:24,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:24,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:24,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:24,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:24,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:24,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:24,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:24,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:24,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:24,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:24,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:24,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:24,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:24,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:24,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:04:24,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:24,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:24,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:24,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:24,305 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:04:24,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:24,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:24,307 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:04:24,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:24,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:24,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:24,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:24,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:24,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:24,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:24,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:04:24,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:24,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:24,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:24,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:24,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:24,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:24,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:24,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:04:24,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:24,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:24,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:24,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:24,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:24,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:24,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:24,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:04:24,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:24,361 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:04:24,381 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 14:04:24,381 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 14:04:24,381 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:04:24,382 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:04:24,382 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:04:24,382 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -1*ULTIMATE.start_rangesum_~i~1 + 1*~N~0 Supporting invariants [] [2018-11-23 14:04:24,393 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 14:04:24,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:24,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:24,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:04:24,439 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:04:24,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 163 transitions. cyclomatic complexity: 41 Second operand 4 states. [2018-11-23 14:04:24,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 163 transitions. cyclomatic complexity: 41. Second operand 4 states. Result 170 states and 212 transitions. Complement of second has 7 states. [2018-11-23 14:04:24,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 14:04:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 14:04:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 14:04:24,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-23 14:04:24,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:24,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 3 letters. [2018-11-23 14:04:24,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:24,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 6 letters. [2018-11-23 14:04:24,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:24,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 212 transitions. [2018-11-23 14:04:24,462 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2018-11-23 14:04:24,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 144 states and 176 transitions. [2018-11-23 14:04:24,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-11-23 14:04:24,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2018-11-23 14:04:24,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 176 transitions. [2018-11-23 14:04:24,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:04:24,465 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 176 transitions. [2018-11-23 14:04:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 176 transitions. [2018-11-23 14:04:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2018-11-23 14:04:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 14:04:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2018-11-23 14:04:24,469 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-11-23 14:04:24,469 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-11-23 14:04:24,470 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 14:04:24,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 168 transitions. [2018-11-23 14:04:24,470 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2018-11-23 14:04:24,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:04:24,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:04:24,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:04:24,471 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:04:24,472 INFO L794 eck$LassoCheckResult]: Stem: 1936#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1932#L-1 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; 1933#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);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; 1940#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1944#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1982#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1981#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1979#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1978#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 1977#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1976#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1975#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1974#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1973#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1972#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1970#L18-3 assume !(rangesum_~i~1 < ~N~0); 1968#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1966#L27 main_#t~ret5 := rangesum_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 1964#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1962#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1960#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1958#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1956#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1955#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1950#L18-8 assume !(rangesum_~i~1 < ~N~0); 1949#L18-9 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1948#L27-1 main_#t~ret8 := rangesum_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; 1938#L46-3 [2018-11-23 14:04:24,472 INFO L796 eck$LassoCheckResult]: Loop: 1938#L46-3 assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; 1939#L46-2 main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; 1938#L46-3 [2018-11-23 14:04:24,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:24,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2018-11-23 14:04:24,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:24,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:24,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:24,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:04:24,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:24,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2018-11-23 14:04:24,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:24,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:24,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:24,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2018-11-23 14:04:24,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:04:24,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:04:24,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:24,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:04:24,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:04:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:04:25,037 WARN L180 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 148 [2018-11-23 14:04:25,377 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-23 14:04:25,378 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:04:25,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:04:25,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:04:25,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:04:25,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:04:25,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:25,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:04:25,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:04:25,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-23 14:04:25,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:04:25,379 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:04:25,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:25,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:25,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:25,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:25,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:25,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:25,430 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 14:04:25,432 INFO L168 Benchmark]: Toolchain (without parser) took 7242.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 290.5 MB). Free memory was 959.1 MB in the beginning and 831.1 MB in the end (delta: 128.0 MB). Peak memory consumption was 418.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:25,433 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:04:25,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:25,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.19 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:04:25,434 INFO L168 Benchmark]: Boogie Preprocessor took 68.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:25,435 INFO L168 Benchmark]: RCFGBuilder took 286.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:25,436 INFO L168 Benchmark]: BuchiAutomizer took 6643.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 831.1 MB in the end (delta: 289.1 MB). Peak memory consumption was 433.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:25,439 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 202.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.19 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 286.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6643.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 831.1 MB in the end (delta: 289.1 MB). Peak memory consumption was 433.8 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...