./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/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_345bbabb-6154-42a2-a298-adea3bf19256/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/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_345bbabb-6154-42a2-a298-adea3bf19256/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-635dfa2 [2018-12-08 10:54:29,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:54:29,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:54:29,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:54:29,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:54:29,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:54:29,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:54:29,486 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:54:29,487 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:54:29,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:54:29,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:54:29,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:54:29,489 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:54:29,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:54:29,490 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:54:29,491 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:54:29,491 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:54:29,493 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:54:29,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:54:29,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:54:29,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:54:29,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:54:29,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:54:29,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:54:29,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:54:29,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:54:29,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:54:29,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:54:29,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:54:29,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:54:29,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:54:29,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:54:29,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:54:29,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:54:29,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:54:29,504 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:54:29,504 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 10:54:29,515 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:54:29,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:54:29,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:54:29,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:54:29,517 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:54:29,517 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 10:54:29,517 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 10:54:29,517 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 10:54:29,517 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 10:54:29,518 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 10:54:29,518 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 10:54:29,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:54:29,518 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 10:54:29,518 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 10:54:29,518 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:54:29,518 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 10:54:29,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:54:29,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 10:54:29,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 10:54:29,519 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 10:54:29,519 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 10:54:29,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:54:29,519 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 10:54:29,520 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:54:29,520 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 10:54:29,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:54:29,520 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:54:29,520 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 10:54:29,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:54:29,520 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:54:29,521 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 10:54:29,521 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 10:54:29,521 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_345bbabb-6154-42a2-a298-adea3bf19256/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-12-08 10:54:29,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:54:29,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:54:29,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:54:29,554 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:54:29,554 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:54:29,554 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-12-08 10:54:29,590 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/bin-2019/uautomizer/data/d508a72ca/64cc5482172240ee93097995a51a2e59/FLAG3083c0acc [2018-12-08 10:54:29,989 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:54:29,989 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-12-08 10:54:29,992 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/bin-2019/uautomizer/data/d508a72ca/64cc5482172240ee93097995a51a2e59/FLAG3083c0acc [2018-12-08 10:54:30,000 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/bin-2019/uautomizer/data/d508a72ca/64cc5482172240ee93097995a51a2e59 [2018-12-08 10:54:30,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:54:30,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:54:30,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:54:30,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:54:30,005 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:54:30,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2778c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30, skipping insertion in model container [2018-12-08 10:54:30,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:54:30,022 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:54:30,118 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:54:30,124 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:54:30,137 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:54:30,145 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:54:30,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30 WrapperNode [2018-12-08 10:54:30,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:54:30,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:54:30,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:54:30,146 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:54:30,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:54:30,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:54:30,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:54:30,202 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:54:30,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... [2018-12-08 10:54:30,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:54:30,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:54:30,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:54:30,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:54:30,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/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-12-08 10:54:30,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:54:30,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:54:30,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:54:30,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:54:30,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 10:54:30,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:54:30,437 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:54:30,437 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 10:54:30,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:54:30 BoogieIcfgContainer [2018-12-08 10:54:30,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:54:30,438 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 10:54:30,438 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 10:54:30,443 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 10:54:30,443 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:54:30,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 10:54:30" (1/3) ... [2018-12-08 10:54:30,445 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c8ee429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:54:30, skipping insertion in model container [2018-12-08 10:54:30,445 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:54:30,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:54:30" (2/3) ... [2018-12-08 10:54:30,445 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c8ee429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:54:30, skipping insertion in model container [2018-12-08 10:54:30,445 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:54:30,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:54:30" (3/3) ... [2018-12-08 10:54:30,447 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum_false-unreach-call_true-termination.i [2018-12-08 10:54:30,485 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:54:30,486 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 10:54:30,486 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 10:54:30,486 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 10:54:30,486 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:54:30,486 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:54:30,486 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 10:54:30,486 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:54:30,486 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 10:54:30,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-12-08 10:54:30,508 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-12-08 10:54:30,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:30,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:30,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 10:54:30,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 10:54:30,513 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 10:54:30,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-12-08 10:54:30,514 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-12-08 10:54:30,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:30,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:30,514 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 10:54:30,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 10:54:30,519 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-12-08 10:54:30,520 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-12-08 10:54:30,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-12-08 10:54:30,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:30,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:30,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:30,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:30,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2018-12-08 10:54:30,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:30,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:30,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:30,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:30,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:30,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:30,601 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2018-12-08 10:54:30,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:30,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:30,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:30,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:30,720 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:54:30,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:54:30,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:54:30,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:54:30,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:54:30,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:54:30,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:54:30,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:54:30,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-08 10:54:30,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:54:30,721 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:54:30,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:30,960 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:54:30,963 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:54:30,965 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-12-08 10:54:30,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:30,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:30,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:30,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:30,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:30,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:30,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:30,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:30,970 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-12-08 10:54:30,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:30,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:30,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:30,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:30,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:30,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:30,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:30,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:30,972 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-12-08 10:54:30,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:30,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:30,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:30,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:30,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:30,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:30,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:30,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:30,974 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-12-08 10:54:30,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:30,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:30,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:30,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:30,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:30,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:30,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:30,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:30,976 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-12-08 10:54:30,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:30,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:30,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:30,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:30,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:30,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:30,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:30,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:30,978 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-12-08 10:54:30,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:30,979 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:54:30,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:30,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:30,981 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:54:30,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:30,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:30,992 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-12-08 10:54:30,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:30,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:30,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:30,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:30,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:30,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:30,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:30,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:30,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:30,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:30,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:30,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:30,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:30,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:30,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:31,027 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:54:31,054 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 10:54:31,054 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 10:54:31,055 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:54:31,056 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:54:31,056 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:54:31,057 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-12-08 10:54:31,069 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 10:54:31,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:31,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:31,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:54:31,135 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-12-08 10:54:31,136 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2018-12-08 10:54:31,201 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-12-08 10:54:31,201 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-12-08 10:54:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 10:54:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-12-08 10:54:31,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-08 10:54:31,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:31,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-08 10:54:31,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:31,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-08 10:54:31,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:31,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 130 transitions. [2018-12-08 10:54:31,208 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 10:54:31,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 23 states and 33 transitions. [2018-12-08 10:54:31,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 10:54:31,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-08 10:54:31,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2018-12-08 10:54:31,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:54:31,212 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-12-08 10:54:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2018-12-08 10:54:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-08 10:54:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 10:54:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2018-12-08 10:54:31,229 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-12-08 10:54:31,229 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-12-08 10:54:31,229 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 10:54:31,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2018-12-08 10:54:31,229 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 10:54:31,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:31,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:31,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 10:54:31,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:54:31,230 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-12-08 10:54:31,230 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-12-08 10:54:31,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,230 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2018-12-08 10:54:31,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:31,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:54:31,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:54:31,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:54:31,257 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:54:31,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,257 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2018-12-08 10:54:31,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:31,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,276 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:54:31,276 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:54:31,276 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:54:31,276 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:54:31,276 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 10:54:31,276 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:54:31,276 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:54:31,276 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:54:31,276 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2018-12-08 10:54:31,276 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:54:31,276 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:54:31,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:31,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:31,336 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:54:31,337 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/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-12-08 10:54:31,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 10:54:31,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 10:54:31,344 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 10:54:31,344 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_345bbabb-6154-42a2-a298-adea3bf19256/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-12-08 10:54:31,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 10:54:31,359 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/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-12-08 10:54:31,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 10:54:31,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 10:54:31,522 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 10:54:31,523 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:54:31,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:54:31,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:54:31,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:54:31,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:54:31,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:54:31,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:54:31,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:54:31,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2018-12-08 10:54:31,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:54:31,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:54:31,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:31,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:31,575 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:54:31,575 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:54:31,576 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-12-08 10:54:31,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:31,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:31,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:31,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:31,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:31,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:31,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:31,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:31,578 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-12-08 10:54:31,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:31,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:31,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:31,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:31,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:31,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:31,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:31,581 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:54:31,583 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 10:54:31,583 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 10:54:31,583 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:54:31,584 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 10:54:31,584 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:54:31,584 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-12-08 10:54:31,584 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 10:54:31,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:31,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:31,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:54:31,653 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-12-08 10:54:31,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-12-08 10:54:31,675 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-12-08 10:54:31,676 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-12-08 10:54:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 10:54:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-08 10:54:31,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-08 10:54:31,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:31,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-08 10:54:31,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:31,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-08 10:54:31,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:31,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2018-12-08 10:54:31,678 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 10:54:31,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2018-12-08 10:54:31,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-08 10:54:31,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-08 10:54:31,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2018-12-08 10:54:31,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:54:31,680 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2018-12-08 10:54:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2018-12-08 10:54:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-08 10:54:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-08 10:54:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2018-12-08 10:54:31,682 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-12-08 10:54:31,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:54:31,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:54:31,685 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2018-12-08 10:54:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:54:31,708 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2018-12-08 10:54:31,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:54:31,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2018-12-08 10:54:31,709 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 10:54:31,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2018-12-08 10:54:31,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-08 10:54:31,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-08 10:54:31,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2018-12-08 10:54:31,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:54:31,710 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-12-08 10:54:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2018-12-08 10:54:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-08 10:54:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-08 10:54:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2018-12-08 10:54:31,711 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-12-08 10:54:31,711 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-12-08 10:54:31,711 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 10:54:31,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2018-12-08 10:54:31,712 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 10:54:31,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:31,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:31,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:54:31,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:54:31,712 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-12-08 10:54:31,713 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-12-08 10:54:31,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2018-12-08 10:54:31,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:31,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:54:31,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:54:31,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/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-12-08 10:54:31,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:31,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:54:31,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:54:31,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-08 10:54:31,786 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:54:31,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,786 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2018-12-08 10:54:31,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:31,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:54:31,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:54:31,816 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2018-12-08 10:54:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:54:31,847 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2018-12-08 10:54:31,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:54:31,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2018-12-08 10:54:31,847 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 10:54:31,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2018-12-08 10:54:31,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-08 10:54:31,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-08 10:54:31,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2018-12-08 10:54:31,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:54:31,848 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2018-12-08 10:54:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2018-12-08 10:54:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-08 10:54:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-08 10:54:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-12-08 10:54:31,849 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-12-08 10:54:31,849 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-12-08 10:54:31,849 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 10:54:31,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2018-12-08 10:54:31,850 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 10:54:31,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:31,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:31,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 10:54:31,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:54:31,850 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-12-08 10:54:31,850 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-12-08 10:54:31,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2018-12-08 10:54:31,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:31,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,862 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2018-12-08 10:54:31,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:31,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2018-12-08 10:54:31,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 10:54:31,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:54:31,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:54:31,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:54:31,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:54:31,913 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-12-08 10:54:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:54:31,952 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-12-08 10:54:31,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:54:31,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-12-08 10:54:31,953 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 10:54:31,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2018-12-08 10:54:31,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-08 10:54:31,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-08 10:54:31,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2018-12-08 10:54:31,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:54:31,954 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-08 10:54:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2018-12-08 10:54:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-12-08 10:54:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-08 10:54:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-12-08 10:54:31,956 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-12-08 10:54:31,956 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-12-08 10:54:31,956 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 10:54:31,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2018-12-08 10:54:31,956 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 10:54:31,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:31,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:31,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:54:31,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:54:31,957 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-12-08 10:54:31,957 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-12-08 10:54:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2018-12-08 10:54:31,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:31,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,975 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2018-12-08 10:54:31,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:31,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2018-12-08 10:54:31,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:31,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:31,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:31,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 10:54:32,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:54:32,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/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-12-08 10:54:32,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:32,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:54:32,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:54:32,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2018-12-08 10:54:32,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:54:32,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:54:32,159 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-12-08 10:54:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:54:32,358 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2018-12-08 10:54:32,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 10:54:32,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 95 transitions. [2018-12-08 10:54:32,360 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2018-12-08 10:54:32,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 85 transitions. [2018-12-08 10:54:32,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-12-08 10:54:32,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-12-08 10:54:32,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2018-12-08 10:54:32,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:54:32,361 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 85 transitions. [2018-12-08 10:54:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2018-12-08 10:54:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-12-08 10:54:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 10:54:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-12-08 10:54:32,365 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-08 10:54:32,365 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-08 10:54:32,365 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 10:54:32,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 82 transitions. [2018-12-08 10:54:32,366 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-12-08 10:54:32,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:32,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:32,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 10:54:32,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:54:32,367 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-12-08 10:54:32,367 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-12-08 10:54:32,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash -194268853, now seen corresponding path program 2 times [2018-12-08 10:54:32,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:32,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:32,384 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2018-12-08 10:54:32,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:32,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:32,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:32,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:32,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:32,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2142422100, now seen corresponding path program 2 times [2018-12-08 10:54:32,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:32,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 10:54:32,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:54:32,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/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-12-08 10:54:32,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 10:54:32,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 10:54:32,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:54:32,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:54:32,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:54:32,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-12-08 10:54:32,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 10:54:32,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-08 10:54:32,602 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. cyclomatic complexity: 21 Second operand 19 states. [2018-12-08 10:54:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:54:32,829 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-12-08 10:54:32,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 10:54:32,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 141 transitions. [2018-12-08 10:54:32,830 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2018-12-08 10:54:32,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 125 transitions. [2018-12-08 10:54:32,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-12-08 10:54:32,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-12-08 10:54:32,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 125 transitions. [2018-12-08 10:54:32,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:54:32,832 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 125 transitions. [2018-12-08 10:54:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 125 transitions. [2018-12-08 10:54:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2018-12-08 10:54:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 10:54:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2018-12-08 10:54:32,836 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2018-12-08 10:54:32,836 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2018-12-08 10:54:32,836 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 10:54:32,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 109 transitions. [2018-12-08 10:54:32,837 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-12-08 10:54:32,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:32,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:32,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 10:54:32,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:54:32,838 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-12-08 10:54:32,838 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-12-08 10:54:32,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:32,838 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 3 times [2018-12-08 10:54:32,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:32,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:32,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:32,858 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2018-12-08 10:54:32,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:32,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:32,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:32,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:32,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:32,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 3 times [2018-12-08 10:54:32,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:32,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:32,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:32,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 10:54:32,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:54:32,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_345bbabb-6154-42a2-a298-adea3bf19256/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-12-08 10:54:32,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 10:54:32,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 10:54:32,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:54:32,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 10:54:33,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:54:33,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-12-08 10:54:33,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 10:54:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-12-08 10:54:33,082 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. cyclomatic complexity: 25 Second operand 17 states. [2018-12-08 10:54:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:54:33,656 INFO L93 Difference]: Finished difference Result 245 states and 301 transitions. [2018-12-08 10:54:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-08 10:54:33,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 301 transitions. [2018-12-08 10:54:33,658 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 41 [2018-12-08 10:54:33,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 231 states and 286 transitions. [2018-12-08 10:54:33,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2018-12-08 10:54:33,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2018-12-08 10:54:33,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 286 transitions. [2018-12-08 10:54:33,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:54:33,661 INFO L705 BuchiCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-12-08 10:54:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 286 transitions. [2018-12-08 10:54:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 133. [2018-12-08 10:54:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-08 10:54:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2018-12-08 10:54:33,666 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-12-08 10:54:33,666 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-12-08 10:54:33,666 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 10:54:33,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 163 transitions. [2018-12-08 10:54:33,667 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2018-12-08 10:54:33,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:33,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:33,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-08 10:54:33,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:54:33,668 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-12-08 10:54:33,668 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-12-08 10:54:33,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 4 times [2018-12-08 10:54:33,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:33,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:33,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:33,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2018-12-08 10:54:33,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:33,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 4 times [2018-12-08 10:54:33,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:33,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:34,242 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 126 [2018-12-08 10:54:34,305 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:54:34,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:54:34,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:54:34,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:54:34,306 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:54:34,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:54:34,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:54:34,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:54:34,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-12-08 10:54:34,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:54:34,306 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:54:34,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:34,621 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:54:34,621 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:54:34,621 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-12-08 10:54:34,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:34,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:34,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:34,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:34,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:34,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:34,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:34,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:34,623 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-12-08 10:54:34,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:34,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:34,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:34,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:34,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:34,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:34,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:34,626 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-12-08 10:54:34,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:34,626 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:54:34,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:34,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:34,627 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:54:34,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:34,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:34,630 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-12-08 10:54:34,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:34,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:34,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:34,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:34,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:34,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:34,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:34,633 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-12-08 10:54:34,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:34,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:34,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:34,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:34,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:34,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:34,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:34,635 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-12-08 10:54:34,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:34,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:34,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:34,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:34,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:34,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:34,659 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:54:34,671 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 10:54:34,671 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 10:54:34,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:54:34,672 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:54:34,672 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:54:34,672 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-12-08 10:54:34,680 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-12-08 10:54:34,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:34,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:34,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:54:34,714 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-12-08 10:54:34,714 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 163 transitions. cyclomatic complexity: 41 Second operand 4 states. [2018-12-08 10:54:34,730 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-12-08 10:54:34,730 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-12-08 10:54:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 10:54:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-08 10:54:34,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 3 letters. [2018-12-08 10:54:34,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:34,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 3 letters. [2018-12-08 10:54:34,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:34,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 6 letters. [2018-12-08 10:54:34,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:34,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 212 transitions. [2018-12-08 10:54:34,733 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2018-12-08 10:54:34,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 144 states and 176 transitions. [2018-12-08 10:54:34,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-12-08 10:54:34,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2018-12-08 10:54:34,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 176 transitions. [2018-12-08 10:54:34,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:54:34,734 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 176 transitions. [2018-12-08 10:54:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 176 transitions. [2018-12-08 10:54:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2018-12-08 10:54:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 10:54:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2018-12-08 10:54:34,737 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-12-08 10:54:34,737 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-12-08 10:54:34,737 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 10:54:34,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 168 transitions. [2018-12-08 10:54:34,738 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2018-12-08 10:54:34,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:34,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:34,739 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-12-08 10:54:34,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 10:54:34,739 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-12-08 10:54:34,739 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-12-08 10:54:34,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2018-12-08 10:54:34,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:34,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:34,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:34,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:34,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:34,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2018-12-08 10:54:34,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:34,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2018-12-08 10:54:34,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:34,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:34,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:54:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:35,189 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 150 [2018-12-08 10:54:35,563 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-12-08 10:54:35,566 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:54:35,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:54:35,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:54:35,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:54:35,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:54:35,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:54:35,567 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:54:35,567 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:54:35,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-12-08 10:54:35,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:54:35,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:54:35,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:35,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:35,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:35,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:35,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:35,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:35,623 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-12-08 10:54:35,625 INFO L168 Benchmark]: Toolchain (without parser) took 5622.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 956.0 MB in the beginning and 886.4 MB in the end (delta: 69.6 MB). Peak memory consumption was 382.1 MB. Max. memory is 11.5 GB. [2018-12-08 10:54:35,626 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:54:35,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.43 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 10:54:35,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-08 10:54:35,627 INFO L168 Benchmark]: Boogie Preprocessor took 22.40 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 10:54:35,627 INFO L168 Benchmark]: RCFGBuilder took 213.28 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-08 10:54:35,628 INFO L168 Benchmark]: BuchiAutomizer took 5186.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 886.4 MB in the end (delta: 209.5 MB). Peak memory consumption was 392.5 MB. Max. memory is 11.5 GB. [2018-12-08 10:54:35,631 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.43 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.40 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 213.28 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5186.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 886.4 MB in the end (delta: 209.5 MB). Peak memory consumption was 392.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...