./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8fd34d4e7b646f05601c5a6dde65077f6ebc1b52 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_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-02 13:57:28,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:57:28,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:57:28,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:57:28,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:57:28,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:57:28,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:57:28,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:57:28,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:57:28,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:57:28,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:57:28,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:57:28,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:57:28,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:57:28,184 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:57:28,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:57:28,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:57:28,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:57:28,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:57:28,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:57:28,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:57:28,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:57:28,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:57:28,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:57:28,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:57:28,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:57:28,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:57:28,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:57:28,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:57:28,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:57:28,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:57:28,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:57:28,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:57:28,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:57:28,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:57:28,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:57:28,198 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 13:57:28,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:57:28,209 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:57:28,210 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 13:57:28,210 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 13:57:28,210 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 13:57:28,210 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 13:57:28,210 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 13:57:28,211 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 13:57:28,211 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 13:57:28,211 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 13:57:28,211 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 13:57:28,211 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:57:28,211 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 13:57:28,212 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:57:28,212 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:57:28,212 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 13:57:28,212 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 13:57:28,212 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 13:57:28,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:57:28,212 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 13:57:28,213 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 13:57:28,213 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 13:57:28,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:57:28,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:57:28,213 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 13:57:28,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:57:28,214 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 13:57:28,214 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 13:57:28,214 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 13:57:28,214 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_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fd34d4e7b646f05601c5a6dde65077f6ebc1b52 [2018-12-02 13:57:28,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:57:28,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:57:28,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:57:28,248 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:57:28,248 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:57:28,249 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-12-02 13:57:28,287 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/data/f5374d7b4/b91a2a5f8f7d40d8accf92b2a22f0520/FLAG8af7e00b4 [2018-12-02 13:57:28,638 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:57:28,639 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-12-02 13:57:28,642 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/data/f5374d7b4/b91a2a5f8f7d40d8accf92b2a22f0520/FLAG8af7e00b4 [2018-12-02 13:57:29,020 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/data/f5374d7b4/b91a2a5f8f7d40d8accf92b2a22f0520 [2018-12-02 13:57:29,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:57:29,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:57:29,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:57:29,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:57:29,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:57:29,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c8435a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29, skipping insertion in model container [2018-12-02 13:57:29,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:57:29,047 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:57:29,138 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:57:29,143 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:57:29,157 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:57:29,165 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:57:29,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29 WrapperNode [2018-12-02 13:57:29,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:57:29,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:57:29,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:57:29,166 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:57:29,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:57:29,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:57:29,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:57:29,222 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:57:29,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... [2018-12-02 13:57:29,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:57:29,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:57:29,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:57:29,240 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:57:29,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/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-02 13:57:29,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 13:57:29,273 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2018-12-02 13:57:29,273 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2018-12-02 13:57:29,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 13:57:29,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:57:29,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:57:29,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 13:57:29,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 13:57:29,411 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:57:29,412 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-02 13:57:29,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:57:29 BoogieIcfgContainer [2018-12-02 13:57:29,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:57:29,412 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 13:57:29,413 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 13:57:29,415 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 13:57:29,416 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:57:29,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 01:57:29" (1/3) ... [2018-12-02 13:57:29,417 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c406c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:57:29, skipping insertion in model container [2018-12-02 13:57:29,417 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:57:29,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:57:29" (2/3) ... [2018-12-02 13:57:29,417 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c406c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:57:29, skipping insertion in model container [2018-12-02 13:57:29,417 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:57:29,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:57:29" (3/3) ... [2018-12-02 13:57:29,418 INFO L375 chiAutomizerObserver]: Analyzing ICFG mergeSort_true-termination.c.i [2018-12-02 13:57:29,451 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 13:57:29,452 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 13:57:29,452 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 13:57:29,452 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 13:57:29,452 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:57:29,452 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:57:29,452 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 13:57:29,452 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:57:29,452 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 13:57:29,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-12-02 13:57:29,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-02 13:57:29,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:29,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:29,483 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 13:57:29,483 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 13:57:29,483 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 13:57:29,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-12-02 13:57:29,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-02 13:57:29,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:29,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:29,485 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 13:57:29,485 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 13:57:29,490 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 30#L35true assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4#L40-3true [2018-12-02 13:57:29,490 INFO L796 eck$LassoCheckResult]: Loop: 4#L40-3true assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 5#L40-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4#L40-3true [2018-12-02 13:57:29,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:29,494 INFO L82 PathProgramCache]: Analyzing trace with hash 88447, now seen corresponding path program 1 times [2018-12-02 13:57:29,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:29,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:29,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:29,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:29,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:29,561 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2018-12-02 13:57:29,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:29,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:29,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:29,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:29,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:29,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:29,572 INFO L82 PathProgramCache]: Analyzing trace with hash 84999937, now seen corresponding path program 1 times [2018-12-02 13:57:29,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:29,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:29,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:29,707 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:57:29,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:57:29,708 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:57:29,708 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:57:29,708 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:57:29,708 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:57:29,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:57:29,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:57:29,709 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration1_Lasso [2018-12-02 13:57:29,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:57:29,709 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:57:29,728 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-02 13:57:29,732 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-02 13:57:29,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-02 13:57:29,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-02 13:57:29,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-02 13:57:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:29,952 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:57:29,955 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:57:29,956 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-02 13:57:29,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:29,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:29,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:29,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:29,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:29,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:29,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:29,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:29,962 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-02 13:57:29,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:29,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:29,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:29,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:29,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:29,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:29,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:29,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:29,964 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-02 13:57:29,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:29,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:29,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:29,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:29,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:29,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:29,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:29,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-02 13:57:29,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:29,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:29,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:29,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:29,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:29,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:29,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:29,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:29,973 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-02 13:57:29,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:29,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:29,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:29,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:29,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:29,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:29,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:29,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:29,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:29,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:29,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:29,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:29,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:29,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:29,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:29,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:29,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:29,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:29,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:29,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:29,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:29,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:29,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:30,040 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:57:30,066 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 13:57:30,066 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-02 13:57:30,068 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:57:30,070 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 13:57:30,070 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:57:30,070 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1, ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1 - 4*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2018-12-02 13:57:30,076 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 13:57:30,082 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 13:57:30,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:30,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:30,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:30,141 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-02 13:57:30,151 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-02 13:57:30,151 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 3 states. [2018-12-02 13:57:30,205 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 3 states. Result 59 states and 83 transitions. Complement of second has 9 states. [2018-12-02 13:57:30,205 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-02 13:57:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 13:57:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-12-02 13:57:30,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-02 13:57:30,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:30,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 13:57:30,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:30,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-02 13:57:30,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:30,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2018-12-02 13:57:30,213 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 13:57:30,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 26 states and 37 transitions. [2018-12-02 13:57:30,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-02 13:57:30,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 13:57:30,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2018-12-02 13:57:30,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 13:57:30,219 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-12-02 13:57:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2018-12-02 13:57:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-02 13:57:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 13:57:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-12-02 13:57:30,238 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-12-02 13:57:30,238 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-12-02 13:57:30,238 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 13:57:30,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2018-12-02 13:57:30,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 13:57:30,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:30,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:30,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 13:57:30,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 13:57:30,239 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 165#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 155#L40-3 assume !(main_~i~1 < main_~n~0); 151#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 169#merge_sortENTRY [2018-12-02 13:57:30,240 INFO L796 eck$LassoCheckResult]: Loop: 169#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 158#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 152#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 169#merge_sortENTRY [2018-12-02 13:57:30,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash 84999888, now seen corresponding path program 1 times [2018-12-02 13:57:30,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:30,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:30,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:30,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:30,268 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-02 13:57:30,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:57:30,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:57:30,270 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 13:57:30,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2018-12-02 13:57:30,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:30,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:30,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:57:30,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:57:30,384 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-12-02 13:57:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:30,393 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2018-12-02 13:57:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:57:30,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-12-02 13:57:30,394 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 13:57:30,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2018-12-02 13:57:30,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-02 13:57:30,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 13:57:30,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-12-02 13:57:30,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 13:57:30,396 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-02 13:57:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-12-02 13:57:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-02 13:57:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 13:57:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-12-02 13:57:30,397 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-12-02 13:57:30,397 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-12-02 13:57:30,397 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 13:57:30,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2018-12-02 13:57:30,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 13:57:30,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:30,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:30,399 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:30,399 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 13:57:30,399 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 223#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 224#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 214#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 215#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 216#L40-3 assume !(main_~i~1 < main_~n~0); 211#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 228#merge_sortENTRY [2018-12-02 13:57:30,399 INFO L796 eck$LassoCheckResult]: Loop: 228#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 217#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 209#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 228#merge_sortENTRY [2018-12-02 13:57:30,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash 80563154, now seen corresponding path program 1 times [2018-12-02 13:57:30,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:30,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:30,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:30,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 2 times [2018-12-02 13:57:30,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:30,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:30,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:30,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash -829797441, now seen corresponding path program 1 times [2018-12-02 13:57:30,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:30,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:30,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:30,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:30,460 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-02 13:57:30,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:57:30,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:57:30,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:30,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:30,489 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-02 13:57:30,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:57:30,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 13:57:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 13:57:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:57:30,596 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-12-02 13:57:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:30,649 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-12-02 13:57:30,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:57:30,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2018-12-02 13:57:30,650 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 13:57:30,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2018-12-02 13:57:30,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-02 13:57:30,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 13:57:30,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-12-02 13:57:30,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 13:57:30,653 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-12-02 13:57:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-12-02 13:57:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-12-02 13:57:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 13:57:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-02 13:57:30,655 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-02 13:57:30,655 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-02 13:57:30,655 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 13:57:30,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-02 13:57:30,655 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 13:57:30,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:30,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:30,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-02 13:57:30,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 13:57:30,656 INFO L794 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 330#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 331#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 320#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 321#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 322#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 323#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 341#L40-3 assume !(main_~i~1 < main_~n~0); 316#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 335#merge_sortENTRY [2018-12-02 13:57:30,656 INFO L796 eck$LassoCheckResult]: Loop: 335#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 324#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 315#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 335#merge_sortENTRY [2018-12-02 13:57:30,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash 111829076, now seen corresponding path program 2 times [2018-12-02 13:57:30,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:30,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:30,669 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 3 times [2018-12-02 13:57:30,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:30,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:30,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:30,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1394618371, now seen corresponding path program 2 times [2018-12-02 13:57:30,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:30,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:30,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:30,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,026 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:57:31,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:57:31,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:57:31,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:57:31,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:57:31,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:57:31,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:57:31,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:57:31,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration4_Lasso [2018-12-02 13:57:31,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:57:31,027 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:57:31,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,030 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-02 13:57:31,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,032 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-02 13:57:31,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,040 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-02 13:57:31,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,046 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-02 13:57:31,047 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-02 13:57:31,048 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-02 13:57:31,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:31,064 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-02 13:57:31,067 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-02 13:57:31,068 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-02 13:57:31,070 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-02 13:57:31,070 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-02 13:57:31,071 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-02 13:57:31,072 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-02 13:57:31,073 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-02 13:57:31,074 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-02 13:57:31,075 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-02 13:57:31,076 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-02 13:57:31,077 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-02 13:57:31,078 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-02 13:57:31,079 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-02 13:57:31,080 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-02 13:57:31,081 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-02 13:57:31,082 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-02 13:57:31,083 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-02 13:57:31,084 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-02 13:57:31,084 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-02 13:57:31,085 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-02 13:57:31,086 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-02 13:57:31,087 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-02 13:57:31,088 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-02 13:57:31,089 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-02 13:57:31,090 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-02 13:57:31,119 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-02 13:57:31,120 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-02 13:57:31,120 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-02 13:57:31,259 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:57:31,259 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:57:31,260 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-02 13:57:31,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,262 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-02 13:57:31,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,263 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-02 13:57:31,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,265 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-02 13:57:31,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,267 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-02 13:57:31,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,268 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-02 13:57:31,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,270 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-02 13:57:31,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,272 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-02 13:57:31,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,273 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-02 13:57:31,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:31,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,276 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-02 13:57:31,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,278 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-02 13:57:31,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,280 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-02 13:57:31,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,281 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-02 13:57:31,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,283 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-02 13:57:31,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,285 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-02 13:57:31,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:31,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:31,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,288 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-02 13:57:31,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,290 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-02 13:57:31,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,292 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-02 13:57:31,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,293 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-02 13:57:31,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:31,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,296 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-02 13:57:31,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,297 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-02 13:57:31,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,298 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-02 13:57:31,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,299 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-02 13:57:31,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:31,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:31,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,301 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-02 13:57:31,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,303 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-02 13:57:31,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,304 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-02 13:57:31,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:31,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,307 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-02 13:57:31,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,308 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-02 13:57:31,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,310 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-02 13:57:31,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:31,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,313 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-02 13:57:31,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,315 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-02 13:57:31,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,317 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-02 13:57:31,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:31,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,321 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-02 13:57:31,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,322 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-02 13:57:31,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,324 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-02 13:57:31,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,326 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-02 13:57:31,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,328 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-02 13:57:31,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,330 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-02 13:57:31,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,331 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-02 13:57:31,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,333 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-02 13:57:31,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,335 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-02 13:57:31,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,336 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-02 13:57:31,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:31,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:31,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:31,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,337 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-02 13:57:31,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,337 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:57:31,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,338 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:57:31,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:31,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:31,341 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-02 13:57:31,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:31,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:31,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:31,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:31,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:31,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:31,352 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:57:31,357 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 13:57:31,357 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 13:57:31,358 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:57:31,358 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 13:57:31,359 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:57:31,359 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2018-12-02 13:57:31,362 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 13:57:31,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:31,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:31,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:31,429 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-02 13:57:31,429 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-02 13:57:31,429 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-02 13:57:31,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2018-12-02 13:57:31,477 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-02 13:57:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 13:57:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-02 13:57:31,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-02 13:57:31,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:31,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2018-12-02 13:57:31,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:31,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-02 13:57:31,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:31,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-12-02 13:57:31,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 13:57:31,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 49 transitions. [2018-12-02 13:57:31,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 13:57:31,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-02 13:57:31,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2018-12-02 13:57:31,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:31,480 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-12-02 13:57:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2018-12-02 13:57:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-02 13:57:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 13:57:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-12-02 13:57:31,482 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-12-02 13:57:31,482 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-12-02 13:57:31,482 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 13:57:31,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2018-12-02 13:57:31,483 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 13:57:31,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:31,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:31,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:31,484 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:31,484 INFO L794 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 479#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 480#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 467#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 468#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 469#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 470#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 494#L40-3 assume !(main_~i~1 < main_~n~0); 463#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 484#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 473#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 462#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 490#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 471#L24 assume ~n < 2; 472#L8 assume true; 481#merge_sortEXIT >#86#return; 461#L27-1 [2018-12-02 13:57:31,484 INFO L796 eck$LassoCheckResult]: Loop: 461#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 491#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 493#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 464#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 491#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 493#L24 assume ~n < 2; 477#L8 assume true; 492#merge_sortEXIT >#86#return; 461#L27-1 [2018-12-02 13:57:31,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:31,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744228, now seen corresponding path program 1 times [2018-12-02 13:57:31,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:31,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 1 times [2018-12-02 13:57:31,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:31,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:31,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:31,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:31,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1064649429, now seen corresponding path program 1 times [2018-12-02 13:57:31,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:31,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 13:57:31,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:57:31,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:57:31,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:31,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:57:31,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:57:31,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-12-02 13:57:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 13:57:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-02 13:57:31,831 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 13 states. [2018-12-02 13:57:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:31,923 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-12-02 13:57:31,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 13:57:31,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-12-02 13:57:31,925 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-12-02 13:57:31,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 65 states and 81 transitions. [2018-12-02 13:57:31,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-12-02 13:57:31,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-12-02 13:57:31,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2018-12-02 13:57:31,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:31,927 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2018-12-02 13:57:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2018-12-02 13:57:31,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-02 13:57:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 13:57:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-12-02 13:57:31,931 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-12-02 13:57:31,931 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-12-02 13:57:31,931 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 13:57:31,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2018-12-02 13:57:31,932 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-12-02 13:57:31,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:31,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:31,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:31,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:31,933 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 680#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 681#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 663#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 664#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 665#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 666#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 710#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 707#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 706#L40-3 assume !(main_~i~1 < main_~n~0); 670#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 701#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 669#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 671#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 697#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 698#L24 assume ~n < 2; 723#L8 assume true; 720#merge_sortEXIT >#86#return; 674#L27-1 [2018-12-02 13:57:31,933 INFO L796 eck$LassoCheckResult]: Loop: 674#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 699#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 721#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 673#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 699#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 721#L24 assume ~n < 2; 722#L8 assume true; 718#merge_sortEXIT >#86#return; 674#L27-1 [2018-12-02 13:57:31,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 2 times [2018-12-02 13:57:31,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:31,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 2 times [2018-12-02 13:57:31,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:31,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:31,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash -889748845, now seen corresponding path program 2 times [2018-12-02 13:57:31,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:31,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:31,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:31,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:32,338 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-12-02 13:57:32,528 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:57:32,528 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:57:32,528 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:57:32,528 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:57:32,529 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:57:32,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:57:32,529 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:57:32,529 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:57:32,529 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration6_Lasso [2018-12-02 13:57:32,529 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:57:32,529 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:57:32,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,533 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-02 13:57:32,534 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-02 13:57:32,535 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-02 13:57:32,536 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-02 13:57:32,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,538 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-02 13:57:32,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,541 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-02 13:57:32,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,543 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-02 13:57:32,543 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-02 13:57:32,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,545 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-02 13:57:32,546 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-02 13:57:32,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,548 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-02 13:57:32,548 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-02 13:57:32,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,550 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-02 13:57:32,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,552 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-02 13:57:32,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,554 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-02 13:57:32,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,558 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-02 13:57:32,559 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-02 13:57:32,560 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-02 13:57:32,561 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-02 13:57:32,562 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-02 13:57:32,563 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-02 13:57:32,566 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-02 13:57:32,566 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-02 13:57:32,567 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-02 13:57:32,568 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-02 13:57:32,569 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-02 13:57:32,569 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-02 13:57:32,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-02 13:57:32,571 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-02 13:57:32,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-02 13:57:32,617 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-02 13:57:32,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:32,620 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-02 13:57:32,820 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:57:32,820 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:57:32,820 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-02 13:57:32,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,822 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-02 13:57:32,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,823 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-02 13:57:32,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,824 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-02 13:57:32,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,825 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-02 13:57:32,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:32,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:32,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,826 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-02 13:57:32,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,827 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-02 13:57:32,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,829 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-02 13:57:32,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,829 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-02 13:57:32,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,830 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-02 13:57:32,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,831 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-02 13:57:32,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,832 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-02 13:57:32,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,833 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-02 13:57:32,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,834 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-02 13:57:32,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,835 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-02 13:57:32,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,836 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-02 13:57:32,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,837 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-02 13:57:32,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,839 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-02 13:57:32,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,840 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-02 13:57:32,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,841 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-02 13:57:32,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,842 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-02 13:57:32,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,843 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-02 13:57:32,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,844 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-02 13:57:32,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,844 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-02 13:57:32,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:32,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:32,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:32,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,847 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-02 13:57:32,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,848 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-02 13:57:32,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,849 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-02 13:57:32,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,850 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-02 13:57:32,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,851 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-02 13:57:32,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,852 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-02 13:57:32,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,853 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-02 13:57:32,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,854 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-02 13:57:32,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,855 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-02 13:57:32,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,856 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-02 13:57:32,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,857 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-02 13:57:32,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,858 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-02 13:57:32,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,859 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-02 13:57:32,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,860 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-02 13:57:32,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,861 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-02 13:57:32,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,862 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-02 13:57:32,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,863 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-02 13:57:32,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:32,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:32,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:32,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,864 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-02 13:57:32,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:32,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:32,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,867 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-02 13:57:32,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:32,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:32,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,869 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-02 13:57:32,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,870 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:57:32,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,870 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:57:32,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:32,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:32,873 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-02 13:57:32,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:32,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:32,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:32,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:32,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:32,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:32,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:57:32,901 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 13:57:32,901 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-02 13:57:32,901 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:57:32,902 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 13:57:32,902 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:57:32,902 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~n, merge_sort_~m~0) = 1*merge_sort_~n - 1*merge_sort_~m~0 Supporting invariants [] [2018-12-02 13:57:32,902 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 13:57:32,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:32,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:32,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:57:32,998 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-02 13:57:32,998 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-12-02 13:57:33,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23. Second operand 7 states. Result 310 states and 425 transitions. Complement of second has 28 states. [2018-12-02 13:57:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 13:57:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 13:57:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2018-12-02 13:57:33,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 8 letters. [2018-12-02 13:57:33,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:33,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 26 letters. Loop has 8 letters. [2018-12-02 13:57:33,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:33,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 16 letters. [2018-12-02 13:57:33,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:33,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 425 transitions. [2018-12-02 13:57:33,116 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2018-12-02 13:57:33,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 227 states and 317 transitions. [2018-12-02 13:57:33,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2018-12-02 13:57:33,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2018-12-02 13:57:33,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 317 transitions. [2018-12-02 13:57:33,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:33,121 INFO L705 BuchiCegarLoop]: Abstraction has 227 states and 317 transitions. [2018-12-02 13:57:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 317 transitions. [2018-12-02 13:57:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 206. [2018-12-02 13:57:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-02 13:57:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 282 transitions. [2018-12-02 13:57:33,133 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 282 transitions. [2018-12-02 13:57:33,133 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 282 transitions. [2018-12-02 13:57:33,133 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 13:57:33,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 282 transitions. [2018-12-02 13:57:33,135 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2018-12-02 13:57:33,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:33,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:33,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:33,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 13:57:33,136 INFO L794 eck$LassoCheckResult]: Stem: 1218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1201#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 1202#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1176#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1177#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1178#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1179#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1180#L40-3 assume !(main_~i~1 < main_~n~0); 1170#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1209#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1266#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1228#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1229#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1348#L24 assume ~n < 2; 1347#L8 assume true; 1342#merge_sortEXIT >#86#return; 1182#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1223#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1181#L24 assume ~n < 2; 1183#L8 assume true; 1203#merge_sortEXIT >#88#return; 1205#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1206#L11-3 [2018-12-02 13:57:33,136 INFO L796 eck$LassoCheckResult]: Loop: 1206#L11-3 assume !!(merge_~k~0 < merge_~n); 1212#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 1199#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 1214#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1206#L11-3 [2018-12-02 13:57:33,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:33,136 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 1 times [2018-12-02 13:57:33,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:33,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2018-12-02 13:57:33,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:33,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:33,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:33,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:33,158 INFO L82 PathProgramCache]: Analyzing trace with hash -782974256, now seen corresponding path program 1 times [2018-12-02 13:57:33,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:33,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 13:57:33,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:57:33,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:57:33,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:57:33,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:57:33,237 INFO L87 Difference]: Start difference. First operand 206 states and 282 transitions. cyclomatic complexity: 100 Second operand 4 states. [2018-12-02 13:57:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:33,261 INFO L93 Difference]: Finished difference Result 319 states and 436 transitions. [2018-12-02 13:57:33,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:57:33,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 436 transitions. [2018-12-02 13:57:33,266 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 134 [2018-12-02 13:57:33,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 436 transitions. [2018-12-02 13:57:33,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2018-12-02 13:57:33,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2018-12-02 13:57:33,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 436 transitions. [2018-12-02 13:57:33,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:33,272 INFO L705 BuchiCegarLoop]: Abstraction has 319 states and 436 transitions. [2018-12-02 13:57:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 436 transitions. [2018-12-02 13:57:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 260. [2018-12-02 13:57:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 13:57:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 345 transitions. [2018-12-02 13:57:33,284 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2018-12-02 13:57:33,285 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2018-12-02 13:57:33,285 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 13:57:33,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 345 transitions. [2018-12-02 13:57:33,286 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2018-12-02 13:57:33,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:33,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:33,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:33,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:33,287 INFO L794 eck$LassoCheckResult]: Stem: 1770#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1744#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 1745#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1715#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1716#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1717#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1718#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1719#L40-3 assume !(main_~i~1 < main_~n~0); 1705#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1753#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1822#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1780#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1781#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1841#L24 assume ~n < 2; 1840#L8 assume true; 1839#merge_sortEXIT >#86#return; 1721#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1782#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1720#L24 assume ~n < 2; 1722#L8 assume true; 1765#merge_sortEXIT >#88#return; 1749#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1750#L11-3 [2018-12-02 13:57:33,287 INFO L796 eck$LassoCheckResult]: Loop: 1750#L11-3 assume !!(merge_~k~0 < merge_~n); 1773#L12 assume !(merge_~j~0 == merge_~n); 1957#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 1961#L14 assume !(merge_#t~mem7 < merge_#t~mem8);merge_#t~post11 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post11;call merge_#t~mem12 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post11, 4);merge_#t~ite13 := merge_#t~mem12; 1959#L14-2 merge_#t~ite14 := merge_#t~ite13; 1958#L13-2 merge_#t~ite15 := merge_#t~ite14; 1761#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 1762#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1750#L11-3 [2018-12-02 13:57:33,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 2 times [2018-12-02 13:57:33,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:33,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:33,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:33,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2018-12-02 13:57:33,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 389830265, now seen corresponding path program 1 times [2018-12-02 13:57:33,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:33,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:33,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:33,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:33,655 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 115 [2018-12-02 13:57:34,063 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2018-12-02 13:57:34,127 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:57:34,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:57:34,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:57:34,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:57:34,127 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:57:34,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:57:34,128 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:57:34,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:57:34,128 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration8_Lasso [2018-12-02 13:57:34,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:57:34,128 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:57:34,130 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-02 13:57:34,131 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-02 13:57:34,132 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-02 13:57:34,133 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-02 13:57:34,309 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2018-12-02 13:57:34,390 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-02 13:57:34,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:34,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:34,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:34,394 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-02 13:57:34,395 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-02 13:57:34,395 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-02 13:57:34,396 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-02 13:57:34,397 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-02 13:57:34,398 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-02 13:57:34,399 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-02 13:57:34,400 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-02 13:57:34,401 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-02 13:57:34,402 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-02 13:57:34,402 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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57: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-02 13:57:34,540 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-12-02 13:57:34,801 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-02 13:57:34,866 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:57:34,866 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:57:34,867 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-02 13:57:34,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:34,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:34,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:34,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:34,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:34,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:34,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:34,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:34,869 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-02 13:57:34,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:34,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:34,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:34,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:34,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:34,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:34,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:34,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:34,870 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-02 13:57:34,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:34,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:34,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:34,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:34,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:34,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:34,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:34,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:34,872 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-02 13:57:34,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:34,872 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:57:34,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:34,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:34,872 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:57:34,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:34,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:34,874 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-02 13:57:34,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:34,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:34,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:34,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:34,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:34,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:34,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:34,877 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-02 13:57:34,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:34,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:34,877 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-02 13:57:34,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:34,904 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-12-02 13:57:34,904 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-02 13:57:36,176 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:57:36,534 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 13:57:36,535 INFO L444 ModelExtractionUtils]: 184 out of 208 variables were initially zero. Simplification set additionally 20 variables to zero. [2018-12-02 13:57:36,535 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:57:36,537 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2018-12-02 13:57:36,537 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:57:36,537 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~x~0.offset, v_rep(select #length merge_sort_merge_~x~0.base)_1, merge_sort_merge_~k~0) = -1*merge_sort_merge_~x~0.offset + 1*v_rep(select #length merge_sort_merge_~x~0.base)_1 - 4*merge_sort_merge_~k~0 Supporting invariants [] [2018-12-02 13:57:36,560 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 13:57:36,561 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 13:57:36,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:36,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:36,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:36,624 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-02 13:57:36,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 13:57:36,625 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 345 transitions. cyclomatic complexity: 109 Second operand 5 states. [2018-12-02 13:57:36,682 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 345 transitions. cyclomatic complexity: 109. Second operand 5 states. Result 567 states and 781 transitions. Complement of second has 14 states. [2018-12-02 13:57:36,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 13:57:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 13:57:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-12-02 13:57:36,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 22 letters. Loop has 8 letters. [2018-12-02 13:57:36,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:36,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 30 letters. Loop has 8 letters. [2018-12-02 13:57:36,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:36,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 22 letters. Loop has 16 letters. [2018-12-02 13:57:36,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:36,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 781 transitions. [2018-12-02 13:57:36,689 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 104 [2018-12-02 13:57:36,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 426 states and 588 transitions. [2018-12-02 13:57:36,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2018-12-02 13:57:36,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2018-12-02 13:57:36,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 426 states and 588 transitions. [2018-12-02 13:57:36,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:36,695 INFO L705 BuchiCegarLoop]: Abstraction has 426 states and 588 transitions. [2018-12-02 13:57:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states and 588 transitions. [2018-12-02 13:57:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 420. [2018-12-02 13:57:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-02 13:57:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2018-12-02 13:57:36,704 INFO L728 BuchiCegarLoop]: Abstraction has 420 states and 580 transitions. [2018-12-02 13:57:36,704 INFO L608 BuchiCegarLoop]: Abstraction has 420 states and 580 transitions. [2018-12-02 13:57:36,704 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 13:57:36,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 420 states and 580 transitions. [2018-12-02 13:57:36,706 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 102 [2018-12-02 13:57:36,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:36,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:36,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:36,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 13:57:36,707 INFO L794 eck$LassoCheckResult]: Stem: 2775#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2742#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 2743#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 2709#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 2710#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2711#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 2712#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2713#L40-3 assume !(main_~i~1 < main_~n~0); 2700#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 2755#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2903#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 2900#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 2901#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2904#L24 assume ~n < 2; 2902#L8 assume true; 2899#merge_sortEXIT >#86#return; 2895#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 2896#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2898#L24 assume ~n < 2; 2897#L8 assume true; 2894#merge_sortEXIT >#88#return; 2890#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 2885#L11-3 assume !(merge_~k~0 < merge_~n); 2874#L11-4 merge_~i~0 := 0; 2699#L17-3 [2018-12-02 13:57:36,707 INFO L796 eck$LassoCheckResult]: Loop: 2699#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 2702#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 2699#L17-3 [2018-12-02 13:57:36,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1013709224, now seen corresponding path program 1 times [2018-12-02 13:57:36,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:36,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:36,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:36,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:36,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 13:57:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:57:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:57:36,723 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 13:57:36,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2018-12-02 13:57:36,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:36,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:36,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:36,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:36,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:57:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:57:36,756 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. cyclomatic complexity: 198 Second operand 4 states. [2018-12-02 13:57:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:36,773 INFO L93 Difference]: Finished difference Result 602 states and 792 transitions. [2018-12-02 13:57:36,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:57:36,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 602 states and 792 transitions. [2018-12-02 13:57:36,778 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 102 [2018-12-02 13:57:36,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 602 states to 602 states and 792 transitions. [2018-12-02 13:57:36,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2018-12-02 13:57:36,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 274 [2018-12-02 13:57:36,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 602 states and 792 transitions. [2018-12-02 13:57:36,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:36,782 INFO L705 BuchiCegarLoop]: Abstraction has 602 states and 792 transitions. [2018-12-02 13:57:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states and 792 transitions. [2018-12-02 13:57:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 437. [2018-12-02 13:57:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-12-02 13:57:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 597 transitions. [2018-12-02 13:57:36,792 INFO L728 BuchiCegarLoop]: Abstraction has 437 states and 597 transitions. [2018-12-02 13:57:36,792 INFO L608 BuchiCegarLoop]: Abstraction has 437 states and 597 transitions. [2018-12-02 13:57:36,792 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 13:57:36,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 437 states and 597 transitions. [2018-12-02 13:57:36,794 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 102 [2018-12-02 13:57:36,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:36,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:36,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:36,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 13:57:36,795 INFO L794 eck$LassoCheckResult]: Stem: 3801#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3774#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 3775#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 3739#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 3740#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3741#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 3742#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3861#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 3743#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3744#L40-3 assume !(main_~i~1 < main_~n~0); 3732#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 3860#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3749#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3750#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 3819#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3842#L24 assume ~n < 2; 3841#L8 assume true; 3840#merge_sortEXIT >#86#return; 3770#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 3837#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3838#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3735#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4012#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4010#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3871#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4007#merge_sortENTRY [2018-12-02 13:57:36,795 INFO L796 eck$LassoCheckResult]: Loop: 4007#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4009#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3868#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4007#merge_sortENTRY [2018-12-02 13:57:36,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:36,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1495319133, now seen corresponding path program 3 times [2018-12-02 13:57:36,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:36,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:36,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:36,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:36,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 13:57:36,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:57:36,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:57:36,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 13:57:36,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 13:57:36,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:57:36,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:57:36,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:57:36,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2018-12-02 13:57:36,992 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 13:57:36,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 4 times [2018-12-02 13:57:36,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:36,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:36,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:36,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:36,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 13:57:37,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-02 13:57:37,078 INFO L87 Difference]: Start difference. First operand 437 states and 597 transitions. cyclomatic complexity: 198 Second operand 18 states. [2018-12-02 13:57:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:37,357 INFO L93 Difference]: Finished difference Result 274 states and 358 transitions. [2018-12-02 13:57:37,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 13:57:37,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 358 transitions. [2018-12-02 13:57:37,359 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 92 [2018-12-02 13:57:37,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 266 states and 350 transitions. [2018-12-02 13:57:37,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2018-12-02 13:57:37,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2018-12-02 13:57:37,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 350 transitions. [2018-12-02 13:57:37,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:37,360 INFO L705 BuchiCegarLoop]: Abstraction has 266 states and 350 transitions. [2018-12-02 13:57:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 350 transitions. [2018-12-02 13:57:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 178. [2018-12-02 13:57:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-02 13:57:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 227 transitions. [2018-12-02 13:57:37,364 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 227 transitions. [2018-12-02 13:57:37,364 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 227 transitions. [2018-12-02 13:57:37,364 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 13:57:37,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 227 transitions. [2018-12-02 13:57:37,365 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 42 [2018-12-02 13:57:37,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:37,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:37,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:37,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 13:57:37,365 INFO L794 eck$LassoCheckResult]: Stem: 4612#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4592#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 4593#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4566#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 4567#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4568#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 4569#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4627#L40-3 assume !(main_~i~1 < main_~n~0); 4562#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 4602#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4727#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4641#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4664#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4665#L24 assume ~n < 2; 4640#L8 assume true; 4642#merge_sortEXIT >#86#return; 4573#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 4618#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4572#L24 assume ~n < 2; 4574#L8 assume true; 4734#merge_sortEXIT >#88#return; 4681#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 4730#L11-3 assume !!(merge_~k~0 < merge_~n); 4608#L12 assume !(merge_~j~0 == merge_~n); 4583#L13 assume merge_~i~0 == merge_~m;merge_#t~post5 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post5;call merge_#t~mem6 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post5, 4);merge_#t~ite14 := merge_#t~mem6; 4584#L13-2 merge_#t~ite15 := merge_#t~ite14; 4591#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 4610#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 4614#L11-3 assume !(merge_~k~0 < merge_~n); 4617#L11-4 merge_~i~0 := 0; 4561#L17-3 [2018-12-02 13:57:37,365 INFO L796 eck$LassoCheckResult]: Loop: 4561#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 4564#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 4561#L17-3 [2018-12-02 13:57:37,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash 336388346, now seen corresponding path program 1 times [2018-12-02 13:57:37,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:37,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:37,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:37,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 13:57:37,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:57:37,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:57:37,385 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 13:57:37,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2018-12-02 13:57:37,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:37,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:37,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:37,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:57:37,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:57:37,412 INFO L87 Difference]: Start difference. First operand 178 states and 227 transitions. cyclomatic complexity: 62 Second operand 4 states. [2018-12-02 13:57:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:37,430 INFO L93 Difference]: Finished difference Result 218 states and 277 transitions. [2018-12-02 13:57:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:57:37,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 277 transitions. [2018-12-02 13:57:37,432 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-12-02 13:57:37,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 218 states and 277 transitions. [2018-12-02 13:57:37,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2018-12-02 13:57:37,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2018-12-02 13:57:37,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 218 states and 277 transitions. [2018-12-02 13:57:37,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:37,434 INFO L705 BuchiCegarLoop]: Abstraction has 218 states and 277 transitions. [2018-12-02 13:57:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states and 277 transitions. [2018-12-02 13:57:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2018-12-02 13:57:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-02 13:57:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 272 transitions. [2018-12-02 13:57:37,439 INFO L728 BuchiCegarLoop]: Abstraction has 213 states and 272 transitions. [2018-12-02 13:57:37,439 INFO L608 BuchiCegarLoop]: Abstraction has 213 states and 272 transitions. [2018-12-02 13:57:37,439 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 13:57:37,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 272 transitions. [2018-12-02 13:57:37,441 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-12-02 13:57:37,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:37,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:37,441 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:37,441 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 13:57:37,442 INFO L794 eck$LassoCheckResult]: Stem: 5019#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4997#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 4998#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4971#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 4972#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4973#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 4974#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4975#L40-3 assume !(main_~i~1 < main_~n~0); 4967#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 5081#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5079#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 5073#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5076#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5094#L24 assume ~n < 2; 5092#L8 assume true; 5072#merge_sortEXIT >#86#return; 5070#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 5071#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5095#L24 assume ~n < 2; 5082#L8 assume true; 5083#merge_sortEXIT >#88#return; 5067#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 5065#L11-3 assume !!(merge_~k~0 < merge_~n); 5066#L12 assume !(merge_~j~0 == merge_~n); 5064#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 5062#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 5063#L14-2 merge_#t~ite14 := merge_#t~ite13; 5056#L13-2 merge_#t~ite15 := merge_#t~ite14; 5052#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 5050#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 5051#L11-3 assume !(merge_~k~0 < merge_~n); 5023#L11-4 merge_~i~0 := 0; 4966#L17-3 [2018-12-02 13:57:37,442 INFO L796 eck$LassoCheckResult]: Loop: 4966#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 4970#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 4966#L17-3 [2018-12-02 13:57:37,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash -810277004, now seen corresponding path program 1 times [2018-12-02 13:57:37,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 13:57:37,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:57:37,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/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-02 13:57:37,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:37,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 13:57:37,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:57:37,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-02 13:57:37,554 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 13:57:37,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:37,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2018-12-02 13:57:37,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:37,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:37,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:37,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:57:37,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:57:37,587 INFO L87 Difference]: Start difference. First operand 213 states and 272 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-12-02 13:57:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:37,622 INFO L93 Difference]: Finished difference Result 353 states and 432 transitions. [2018-12-02 13:57:37,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:57:37,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 432 transitions. [2018-12-02 13:57:37,624 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-12-02 13:57:37,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 353 states and 432 transitions. [2018-12-02 13:57:37,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2018-12-02 13:57:37,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2018-12-02 13:57:37,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 432 transitions. [2018-12-02 13:57:37,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:37,626 INFO L705 BuchiCegarLoop]: Abstraction has 353 states and 432 transitions. [2018-12-02 13:57:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 432 transitions. [2018-12-02 13:57:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 273. [2018-12-02 13:57:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-02 13:57:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 337 transitions. [2018-12-02 13:57:37,631 INFO L728 BuchiCegarLoop]: Abstraction has 273 states and 337 transitions. [2018-12-02 13:57:37,631 INFO L608 BuchiCegarLoop]: Abstraction has 273 states and 337 transitions. [2018-12-02 13:57:37,631 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 13:57:37,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 337 transitions. [2018-12-02 13:57:37,632 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-12-02 13:57:37,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:37,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:37,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:37,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 13:57:37,633 INFO L794 eck$LassoCheckResult]: Stem: 5702#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5672#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 5673#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 5646#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 5647#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5648#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 5649#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5650#L40-3 assume !(main_~i~1 < main_~n~0); 5642#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 5679#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5846#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 5739#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5845#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5847#L24 assume ~n < 2; 5738#L8 assume true; 5740#merge_sortEXIT >#86#return; 5652#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 5714#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5651#L24 assume ~n < 2; 5653#L8 assume true; 5782#merge_sortEXIT >#88#return; 5735#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 5704#L11-3 assume !!(merge_~k~0 < merge_~n); 5705#L12 assume !(merge_~j~0 == merge_~n); 5869#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 5870#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 5889#L14-2 merge_#t~ite14 := merge_#t~ite13; 5888#L13-2 merge_#t~ite15 := merge_#t~ite14; 5887#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 5886#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 5884#L11-3 assume !!(merge_~k~0 < merge_~n); 5881#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 5882#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 5726#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 5727#L11-3 assume !(merge_~k~0 < merge_~n); 5723#L11-4 merge_~i~0 := 0; 5641#L17-3 [2018-12-02 13:57:37,633 INFO L796 eck$LassoCheckResult]: Loop: 5641#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 5645#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 5641#L17-3 [2018-12-02 13:57:37,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:37,633 INFO L82 PathProgramCache]: Analyzing trace with hash 64206937, now seen corresponding path program 1 times [2018-12-02 13:57:37,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:37,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2018-12-02 13:57:37,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:37,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:37,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1573325915, now seen corresponding path program 1 times [2018-12-02 13:57:37,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:37,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:38,473 WARN L180 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 194 [2018-12-02 13:57:38,692 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-12-02 13:57:39,268 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2018-12-02 13:57:39,378 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-02 13:57:39,379 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:57:39,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:57:39,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:57:39,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:57:39,380 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:57:39,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:57:39,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:57:39,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:57:39,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration13_Lasso [2018-12-02 13:57:39,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:57:39,380 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:57:39,383 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-02 13:57:39,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,385 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-02 13:57:39,387 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-02 13:57:39,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,390 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-02 13:57:39,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,394 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-02 13:57:39,394 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-02 13:57:39,395 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-02 13:57:39,396 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-02 13:57:39,397 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-02 13:57:39,398 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-02 13:57:39,398 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-02 13:57:39,399 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-02 13:57:39,400 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-02 13:57:39,401 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-02 13:57:39,402 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-02 13:57:39,402 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-02 13:57:39,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-02 13:57:39,692 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2018-12-02 13:57:39,763 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-02 13:57:39,766 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-02 13:57:39,770 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-02 13:57:39,771 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-02 13:57:39,772 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-02 13:57:39,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,774 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-02 13:57:39,774 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-02 13:57:39,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:57:39,951 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-02 13:57:40,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:57:40,199 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:57:40,199 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-02 13:57:40,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,201 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-02 13:57:40,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,201 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-02 13:57:40,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:40,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,205 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-02 13:57:40,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,207 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-02 13:57:40,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:40,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,210 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-02 13:57:40,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:40,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:40,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,214 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-02 13:57:40,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,215 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-02 13:57:40,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:40,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,218 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-02 13:57:40,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:57:40,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,221 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-02 13:57:40,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,222 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-02 13:57:40,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,224 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-02 13:57:40,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,225 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-02 13:57:40,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,227 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-02 13:57:40,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,229 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-02 13:57:40,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,231 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-02 13:57:40,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,233 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-02 13:57:40,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:57:40,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:57:40,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:57:40,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,234 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-02 13:57:40,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,235 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:57:40,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,235 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:57:40,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,239 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-02 13:57:40,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,241 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-02 13:57:40,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,245 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-02 13:57:40,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,250 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-02 13:57:40,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,254 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-02 13:57:40,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:57:40,257 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-02 13:57:40,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:57:40,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:57:40,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:57:40,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:57:40,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:57:40,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:57:40,278 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:57:40,300 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 13:57:40,300 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 13:57:40,300 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:57:40,301 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 13:57:40,301 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:57:40,301 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, v_rep(select #length merge_sort_merge_~a.base)_2, merge_sort_merge_~i~0) = -1*merge_sort_merge_~a.offset + 1*v_rep(select #length merge_sort_merge_~a.base)_2 - 4*merge_sort_merge_~i~0 Supporting invariants [] [2018-12-02 13:57:40,353 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-12-02 13:57:40,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 13:57:40,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:40,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:40,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:40,417 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-02 13:57:40,417 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 13:57:40,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 273 states and 337 transitions. cyclomatic complexity: 77 Second operand 4 states. [2018-12-02 13:57:40,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 273 states and 337 transitions. cyclomatic complexity: 77. Second operand 4 states. Result 285 states and 356 transitions. Complement of second has 12 states. [2018-12-02 13:57:40,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 13:57:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 13:57:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-12-02 13:57:40,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 2 letters. [2018-12-02 13:57:40,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:40,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 38 letters. Loop has 2 letters. [2018-12-02 13:57:40,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:40,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 4 letters. [2018-12-02 13:57:40,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:57:40,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 356 transitions. [2018-12-02 13:57:40,465 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-12-02 13:57:40,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 224 states and 279 transitions. [2018-12-02 13:57:40,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2018-12-02 13:57:40,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2018-12-02 13:57:40,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 279 transitions. [2018-12-02 13:57:40,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:40,467 INFO L705 BuchiCegarLoop]: Abstraction has 224 states and 279 transitions. [2018-12-02 13:57:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 279 transitions. [2018-12-02 13:57:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-12-02 13:57:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-02 13:57:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 279 transitions. [2018-12-02 13:57:40,470 INFO L728 BuchiCegarLoop]: Abstraction has 224 states and 279 transitions. [2018-12-02 13:57:40,470 INFO L608 BuchiCegarLoop]: Abstraction has 224 states and 279 transitions. [2018-12-02 13:57:40,470 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 13:57:40,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 279 transitions. [2018-12-02 13:57:40,470 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-12-02 13:57:40,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:40,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:40,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:40,471 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:40,472 INFO L794 eck$LassoCheckResult]: Stem: 6476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6441#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 6442#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 6422#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 6423#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6424#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 6425#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6500#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 6499#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6495#L40-3 assume !(main_~i~1 < main_~n~0); 6448#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 6453#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6523#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6524#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6552#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6485#L24 assume ~n < 2; 6553#L8 assume true; 6551#merge_sortEXIT >#86#return; 6419#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6507#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6508#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6470#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6522#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6525#L24 assume ~n < 2; 6521#L8 assume true; 6469#merge_sortEXIT >#86#return; 6471#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6482#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6483#L24 assume ~n < 2; 6569#L8 assume true; 6568#merge_sortEXIT >#88#return; 6567#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 6566#L11-3 assume !!(merge_~k~0 < merge_~n); 6565#L12 assume !(merge_~j~0 == merge_~n); 6564#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 6560#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 6558#L14-2 merge_#t~ite14 := merge_#t~ite13; 6556#L13-2 merge_#t~ite15 := merge_#t~ite14; 6554#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 6549#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6548#L11-3 assume !!(merge_~k~0 < merge_~n); 6539#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 6540#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 6600#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6546#L11-3 assume !(merge_~k~0 < merge_~n); 6497#L11-4 merge_~i~0 := 0; 6489#L17-3 assume !(merge_~i~0 < merge_~n); 6420#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 6591#L8 assume true; 6589#merge_sortEXIT >#88#return; 6513#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 6588#L11-3 assume !!(merge_~k~0 < merge_~n); 6587#L12 assume !(merge_~j~0 == merge_~n); 6586#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 6583#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 6580#L14-2 merge_#t~ite14 := merge_#t~ite13; 6578#L13-2 merge_#t~ite15 := merge_#t~ite14; 6576#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 6574#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6572#L11-3 assume !!(merge_~k~0 < merge_~n); 6571#L12 [2018-12-02 13:57:40,472 INFO L796 eck$LassoCheckResult]: Loop: 6571#L12 assume !(merge_~j~0 == merge_~n); 6585#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 6581#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 6582#L14-2 merge_#t~ite14 := merge_#t~ite13; 6596#L13-2 merge_#t~ite15 := merge_#t~ite14; 6536#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 6537#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6570#L11-3 assume !!(merge_~k~0 < merge_~n); 6571#L12 [2018-12-02 13:57:40,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:40,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1719261906, now seen corresponding path program 1 times [2018-12-02 13:57:40,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:40,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:40,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:40,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:40,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 13:57:40,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:57:40,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/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-02 13:57:40,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:40,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 13:57:40,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:57:40,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-12-02 13:57:40,673 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 13:57:40,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:40,674 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2018-12-02 13:57:40,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:40,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:40,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 13:57:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-12-02 13:57:40,786 INFO L87 Difference]: Start difference. First operand 224 states and 279 transitions. cyclomatic complexity: 66 Second operand 20 states. [2018-12-02 13:57:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:41,295 INFO L93 Difference]: Finished difference Result 371 states and 460 transitions. [2018-12-02 13:57:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 13:57:41,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 371 states and 460 transitions. [2018-12-02 13:57:41,297 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 124 [2018-12-02 13:57:41,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 371 states to 365 states and 454 transitions. [2018-12-02 13:57:41,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2018-12-02 13:57:41,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2018-12-02 13:57:41,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 454 transitions. [2018-12-02 13:57:41,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:41,300 INFO L705 BuchiCegarLoop]: Abstraction has 365 states and 454 transitions. [2018-12-02 13:57:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 454 transitions. [2018-12-02 13:57:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 265. [2018-12-02 13:57:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:57:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 328 transitions. [2018-12-02 13:57:41,306 INFO L728 BuchiCegarLoop]: Abstraction has 265 states and 328 transitions. [2018-12-02 13:57:41,306 INFO L608 BuchiCegarLoop]: Abstraction has 265 states and 328 transitions. [2018-12-02 13:57:41,306 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 13:57:41,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 328 transitions. [2018-12-02 13:57:41,307 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2018-12-02 13:57:41,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:41,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:41,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:41,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:41,308 INFO L794 eck$LassoCheckResult]: Stem: 7306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7279#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 7280#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 7258#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 7259#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7322#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 7323#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7260#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 7261#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7262#L40-3 assume !(main_~i~1 < main_~n~0); 7251#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 7288#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7358#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 7351#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 7356#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7315#L24 assume ~n < 2; 7357#L8 assume true; 7350#merge_sortEXIT >#86#return; 7255#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 7345#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7325#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 7317#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 7318#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7365#L24 assume ~n < 2; 7362#L8 assume true; 7361#merge_sortEXIT >#86#return; 7264#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 7319#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7263#L24 assume ~n < 2; 7265#L8 assume true; 7422#merge_sortEXIT >#88#return; 7421#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 7420#L11-3 assume !!(merge_~k~0 < merge_~n); 7419#L12 assume !(merge_~j~0 == merge_~n); 7418#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 7416#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 7417#L14-2 merge_#t~ite14 := merge_#t~ite13; 7412#L13-2 merge_#t~ite15 := merge_#t~ite14; 7413#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 7304#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7305#L11-3 assume !!(merge_~k~0 < merge_~n); 7295#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 7296#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 7382#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7370#L11-3 assume !(merge_~k~0 < merge_~n); 7327#L11-4 merge_~i~0 := 0; 7328#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 7257#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 7253#L17-3 assume !(merge_~i~0 < merge_~n); 7256#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 7281#L8 assume true; 7282#merge_sortEXIT >#88#return; 7283#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 7284#L11-3 assume !!(merge_~k~0 < merge_~n); 7501#L12 assume !(merge_~j~0 == merge_~n); 7500#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 7498#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 7499#L14-2 merge_#t~ite14 := merge_#t~ite13; 7509#L13-2 merge_#t~ite15 := merge_#t~ite14; 7494#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 7493#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7308#L11-3 assume !!(merge_~k~0 < merge_~n); 7309#L12 [2018-12-02 13:57:41,308 INFO L796 eck$LassoCheckResult]: Loop: 7309#L12 assume !(merge_~j~0 == merge_~n); 7271#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 7272#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 7289#L14-2 merge_#t~ite14 := merge_#t~ite13; 7275#L13-2 merge_#t~ite15 := merge_#t~ite14; 7276#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 7298#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7303#L11-3 assume !!(merge_~k~0 < merge_~n); 7309#L12 [2018-12-02 13:57:41,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2004988308, now seen corresponding path program 1 times [2018-12-02 13:57:41,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:41,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:41,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 13:57:41,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:57:41,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6acef99d-4ae2-4e42-9bc7-a36368a63628/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-02 13:57:41,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:57:41,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:57:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 13:57:41,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:57:41,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-12-02 13:57:41,521 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 13:57:41,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:41,522 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2018-12-02 13:57:41,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:41,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:41,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:57:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 13:57:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-02 13:57:41,624 INFO L87 Difference]: Start difference. First operand 265 states and 328 transitions. cyclomatic complexity: 76 Second operand 21 states. [2018-12-02 13:57:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:57:42,323 INFO L93 Difference]: Finished difference Result 547 states and 692 transitions. [2018-12-02 13:57:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 13:57:42,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 547 states and 692 transitions. [2018-12-02 13:57:42,325 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 208 [2018-12-02 13:57:42,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 547 states to 547 states and 692 transitions. [2018-12-02 13:57:42,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2018-12-02 13:57:42,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2018-12-02 13:57:42,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 692 transitions. [2018-12-02 13:57:42,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:57:42,329 INFO L705 BuchiCegarLoop]: Abstraction has 547 states and 692 transitions. [2018-12-02 13:57:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 692 transitions. [2018-12-02 13:57:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 273. [2018-12-02 13:57:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-02 13:57:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 336 transitions. [2018-12-02 13:57:42,336 INFO L728 BuchiCegarLoop]: Abstraction has 273 states and 336 transitions. [2018-12-02 13:57:42,336 INFO L608 BuchiCegarLoop]: Abstraction has 273 states and 336 transitions. [2018-12-02 13:57:42,336 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-02 13:57:42,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 336 transitions. [2018-12-02 13:57:42,337 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2018-12-02 13:57:42,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:57:42,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:57:42,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:42,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:57:42,339 INFO L794 eck$LassoCheckResult]: Stem: 8374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8351#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 8352#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 8329#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8330#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8388#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8389#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8331#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8332#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8391#L40-3 assume !(main_~i~1 < main_~n~0); 8324#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 8358#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8424#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8386#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8387#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8384#L24 assume ~n < 2; 8443#L8 assume true; 8442#merge_sortEXIT >#86#return; 8342#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8417#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8436#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8420#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8421#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8435#L24 assume ~n < 2; 8434#L8 assume true; 8419#merge_sortEXIT >#86#return; 8381#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8380#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8382#L24 assume ~n < 2; 8455#L8 assume true; 8451#merge_sortEXIT >#88#return; 8452#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 8472#L11-3 assume !!(merge_~k~0 < merge_~n); 8473#L12 assume !(merge_~j~0 == merge_~n); 8468#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 8469#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 8483#L14-2 merge_#t~ite14 := merge_#t~ite13; 8482#L13-2 merge_#t~ite15 := merge_#t~ite14; 8481#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 8480#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8479#L11-3 assume !!(merge_~k~0 < merge_~n); 8477#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 8478#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 8499#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8498#L11-3 assume !(merge_~k~0 < merge_~n); 8404#L11-4 merge_~i~0 := 0; 8405#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 8400#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 8401#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 8396#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 8394#L17-3 assume !(merge_~i~0 < merge_~n); 8395#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 8353#L8 assume true; 8354#merge_sortEXIT >#88#return; 8355#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 8356#L11-3 assume !!(merge_~k~0 < merge_~n); 8582#L12 assume !(merge_~j~0 == merge_~n); 8581#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 8579#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 8578#L14-2 merge_#t~ite14 := merge_#t~ite13; 8577#L13-2 merge_#t~ite15 := merge_#t~ite14; 8576#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 8574#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8575#L11-3 assume !!(merge_~k~0 < merge_~n); 8365#L12 [2018-12-02 13:57:42,339 INFO L796 eck$LassoCheckResult]: Loop: 8365#L12 assume !(merge_~j~0 == merge_~n); 8339#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 8340#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 8359#L14-2 merge_#t~ite14 := merge_#t~ite13; 8590#L13-2 merge_#t~ite15 := merge_#t~ite14; 8589#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post9;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~ite13; 8588#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8584#L11-3 assume !!(merge_~k~0 < merge_~n); 8365#L12 [2018-12-02 13:57:42,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1710153686, now seen corresponding path program 2 times [2018-12-02 13:57:42,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:42,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:42,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:42,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2018-12-02 13:57:42,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:42,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:42,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:42,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:42,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:42,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:57:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1618831734, now seen corresponding path program 3 times [2018-12-02 13:57:42,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:57:42,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:57:42,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:42,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:57:42,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:57:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:57:43,869 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 265 DAG size of output: 225 [2018-12-02 13:57:44,350 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2018-12-02 13:57:44,543 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-12-02 13:57:44,723 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-12-02 13:57:46,039 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 269 DAG size of output: 240 [2018-12-02 13:57:47,141 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 143 DAG size of output: 133 [2018-12-02 13:57:47,263 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-12-02 13:57:47,667 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-02 13:57:47,955 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-02 13:57:49,251 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 185 DAG size of output: 178 [2018-12-02 13:57:49,657 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-02 13:57:49,659 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:57:49,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:57:49,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:57:49,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:57:49,659 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:57:49,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:57:49,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:57:49,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:57:49,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration16_Lasso [2018-12-02 13:57:49,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:57:49,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:57:49,662 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-02 13:57:49,664 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-02 13:57:50,004 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-02 13:57:50,006 INFO L168 Benchmark]: Toolchain (without parser) took 20983.81 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 798.5 MB). Free memory was 961.4 MB in the beginning and 1.3 GB in the end (delta: -330.5 MB). Peak memory consumption was 963.3 MB. Max. memory is 11.5 GB. [2018-12-02 13:57:50,007 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:57:50,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.41 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 13:57:50,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-02 13:57:50,007 INFO L168 Benchmark]: Boogie Preprocessor took 17.50 ms. Allocated memory is still 1.1 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-02 13:57:50,008 INFO L168 Benchmark]: RCFGBuilder took 172.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-02 13:57:50,008 INFO L168 Benchmark]: BuchiAutomizer took 20593.18 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 682.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -205.9 MB). Peak memory consumption was 972.1 MB. Max. memory is 11.5 GB. [2018-12-02 13:57:50,010 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.41 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 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.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.50 ms. Allocated memory is still 1.1 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 172.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20593.18 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 682.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -205.9 MB). Peak memory consumption was 972.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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...