./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/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_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/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_632face9-2d2b-42ed-82cf-c23537aa3fc1/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-1dbac8b [2018-11-10 08:44:03,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:44:03,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:44:03,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:44:03,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:44:03,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:44:03,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:44:03,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:44:03,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:44:03,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:44:03,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:44:03,988 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:44:03,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:44:03,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:44:03,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:44:03,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:44:03,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:44:03,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:44:03,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:44:03,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:44:03,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:44:03,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:44:03,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:44:03,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:44:03,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:44:04,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:44:04,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:44:04,001 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:44:04,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:44:04,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:44:04,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:44:04,004 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:44:04,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:44:04,004 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:44:04,005 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:44:04,005 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:44:04,005 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 08:44:04,016 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:44:04,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:44:04,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:44:04,018 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:44:04,018 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:44:04,018 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:44:04,018 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:44:04,018 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:44:04,019 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:44:04,019 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:44:04,019 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:44:04,019 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:44:04,019 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:44:04,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:44:04,020 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:44:04,020 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:44:04,020 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:44:04,020 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:44:04,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:44:04,020 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:44:04,020 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:44:04,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:44:04,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:44:04,021 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:44:04,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:44:04,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:44:04,021 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:44:04,022 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:44:04,022 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_632face9-2d2b-42ed-82cf-c23537aa3fc1/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-11-10 08:44:04,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:44:04,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:44:04,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:44:04,062 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:44:04,063 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:44:04,063 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-10 08:44:04,113 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/data/929ec4679/9ee566dee0264d8790eaeeec78c938c7/FLAG50e59d144 [2018-11-10 08:44:04,451 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:44:04,451 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-10 08:44:04,456 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/data/929ec4679/9ee566dee0264d8790eaeeec78c938c7/FLAG50e59d144 [2018-11-10 08:44:04,465 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/data/929ec4679/9ee566dee0264d8790eaeeec78c938c7 [2018-11-10 08:44:04,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:44:04,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:44:04,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:44:04,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:44:04,472 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:44:04,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da88f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04, skipping insertion in model container [2018-11-10 08:44:04,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:44:04,497 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:44:04,600 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:44:04,606 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:44:04,623 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:44:04,634 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:44:04,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04 WrapperNode [2018-11-10 08:44:04,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:44:04,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:44:04,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:44:04,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:44:04,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:44:04,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:44:04,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:44:04,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:44:04,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... [2018-11-10 08:44:04,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:44:04,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:44:04,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:44:04,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:44:04,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:44:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 08:44:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2018-11-10 08:44:04,799 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2018-11-10 08:44:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:44:04,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:44:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 08:44:05,077 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:44:05,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:44:05 BoogieIcfgContainer [2018-11-10 08:44:05,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:44:05,078 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:44:05,078 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:44:05,082 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:44:05,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:44:05,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:44:04" (1/3) ... [2018-11-10 08:44:05,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e1ff761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:44:05, skipping insertion in model container [2018-11-10 08:44:05,085 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:44:05,085 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:44:04" (2/3) ... [2018-11-10 08:44:05,085 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e1ff761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:44:05, skipping insertion in model container [2018-11-10 08:44:05,085 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:44:05,085 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:44:05" (3/3) ... [2018-11-10 08:44:05,087 INFO L375 chiAutomizerObserver]: Analyzing ICFG mergeSort_true-termination.c.i [2018-11-10 08:44:05,136 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:44:05,136 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:44:05,137 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:44:05,137 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:44:05,137 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:44:05,137 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:44:05,137 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:44:05,137 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:44:05,137 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:44:05,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-10 08:44:05,173 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2018-11-10 08:44:05,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:05,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:05,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 08:44:05,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:44:05,178 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:44:05,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-10 08:44:05,181 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2018-11-10 08:44:05,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:05,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:05,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 08:44:05,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:44:05,186 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 50#L35true assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 20#L40-4true [2018-11-10 08:44:05,186 INFO L795 eck$LassoCheckResult]: Loop: 20#L40-4true assume true; 8#L40-1true assume !!(main_~i~1 < main_~n~0); 25#L41true SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 23#L41-1true havoc main_#t~nondet21; 4#L40-3true main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 20#L40-4true [2018-11-10 08:44:05,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:05,191 INFO L82 PathProgramCache]: Analyzing trace with hash 105328, now seen corresponding path program 1 times [2018-11-10 08:44:05,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:05,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:05,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:05,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:05,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:05,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash 111808633, now seen corresponding path program 1 times [2018-11-10 08:44:05,275 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:05,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:05,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:05,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:05,287 INFO L82 PathProgramCache]: Analyzing trace with hash 467354218, now seen corresponding path program 1 times [2018-11-10 08:44:05,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:05,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:05,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:05,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:05,480 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:44:05,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:44:05,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:44:05,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:44:05,482 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:44:05,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:44:05,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:44:05,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:44:05,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration1_Lasso [2018-11-10 08:44:05,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:44:05,483 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:44:05,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:05,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:05,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:05,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:05,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:05,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:05,862 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:44:05,866 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:44:05,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-11-10 08:44:05,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:05,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:05,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:05,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:05,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:05,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:05,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:05,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:05,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-11-10 08:44:05,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:05,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:05,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:05,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:05,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:05,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:05,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:05,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:05,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:05,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:05,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:05,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:05,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:05,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:05,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:05,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:05,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:05,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:05,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:05,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:05,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:05,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:05,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:05,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:05,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:05,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:05,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:05,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:05,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:05,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:05,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:05,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:05,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:05,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:05,916 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:44:05,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:05,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:05,919 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:44:05,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:05,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:05,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:05,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:05,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:05,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:05,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:05,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:05,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:05,973 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:44:05,998 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 08:44:05,998 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 08:44:06,000 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:44:06,001 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:44:06,002 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:44:06,002 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~1) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-10 08:44:06,020 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 08:44:06,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:06,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:06,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:06,080 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 08:44:06,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states. Second operand 4 states. [2018-11-10 08:44:06,123 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states.. Second operand 4 states. Result 99 states and 121 transitions. Complement of second has 9 states. [2018-11-10 08:44:06,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:44:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:44:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-10 08:44:06,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-10 08:44:06,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:06,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 08:44:06,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:06,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-10 08:44:06,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:06,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 121 transitions. [2018-11-10 08:44:06,135 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 08:44:06,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 47 states and 58 transitions. [2018-11-10 08:44:06,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 08:44:06,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 08:44:06,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2018-11-10 08:44:06,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:06,142 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-10 08:44:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2018-11-10 08:44:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-10 08:44:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 08:44:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-10 08:44:06,164 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-10 08:44:06,164 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-10 08:44:06,164 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:44:06,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 58 transitions. [2018-11-10 08:44:06,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 08:44:06,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:06,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:06,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:44:06,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 08:44:06,165 INFO L793 eck$LassoCheckResult]: Stem: 257#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 239#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 249#L40-4 assume true; 229#L40-1 assume !(main_~i~1 < main_~n~0); 215#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 246#merge_sortENTRY [2018-11-10 08:44:06,165 INFO L795 eck$LassoCheckResult]: Loop: 246#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 222#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 216#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 246#merge_sortENTRY [2018-11-10 08:44:06,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1157054342, now seen corresponding path program 1 times [2018-11-10 08:44:06,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:06,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:06,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:06,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:06,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:44:06,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:44:06,209 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:44:06,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash 30020, now seen corresponding path program 1 times [2018-11-10 08:44:06,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:06,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:06,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:44:06,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:44:06,356 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-10 08:44:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:06,369 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-10 08:44:06,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:44:06,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-11-10 08:44:06,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 08:44:06,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 51 states and 59 transitions. [2018-11-10 08:44:06,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 08:44:06,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 08:44:06,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 59 transitions. [2018-11-10 08:44:06,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:06,374 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-10 08:44:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 59 transitions. [2018-11-10 08:44:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-10 08:44:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 08:44:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-10 08:44:06,377 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-10 08:44:06,378 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-10 08:44:06,378 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:44:06,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2018-11-10 08:44:06,379 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 08:44:06,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:06,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:06,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:06,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 08:44:06,381 INFO L793 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 344#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 354#L40-4 assume true; 334#L40-1 assume !!(main_~i~1 < main_~n~0); 335#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 361#L41-1 havoc main_#t~nondet21; 325#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 326#L40-4 assume true; 333#L40-1 assume !(main_~i~1 < main_~n~0); 320#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 351#merge_sortENTRY [2018-11-10 08:44:06,381 INFO L795 eck$LassoCheckResult]: Loop: 351#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 327#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 319#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 351#merge_sortENTRY [2018-11-10 08:44:06,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:06,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1334378688, now seen corresponding path program 1 times [2018-11-10 08:44:06,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:06,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:06,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:06,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:06,400 INFO L82 PathProgramCache]: Analyzing trace with hash 30020, now seen corresponding path program 2 times [2018-11-10 08:44:06,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:06,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1741797797, now seen corresponding path program 1 times [2018-11-10 08:44:06,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:06,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:06,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:06,455 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:06,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:06,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:06,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:44:06,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 08:44:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 08:44:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:44:06,629 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-10 08:44:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:06,674 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-10 08:44:06,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:44:06,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 73 transitions. [2018-11-10 08:44:06,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 08:44:06,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 58 states and 67 transitions. [2018-11-10 08:44:06,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-10 08:44:06,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 08:44:06,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2018-11-10 08:44:06,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:06,680 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-11-10 08:44:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2018-11-10 08:44:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-11-10 08:44:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 08:44:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-10 08:44:06,685 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-10 08:44:06,685 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-10 08:44:06,685 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 08:44:06,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-11-10 08:44:06,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 08:44:06,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:06,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:06,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 08:44:06,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 08:44:06,687 INFO L793 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 510#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 511#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 521#L40-4 assume true; 522#L40-1 assume !!(main_~i~1 < main_~n~0); 536#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 535#L41-1 havoc main_#t~nondet21; 534#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 523#L40-4 assume true; 501#L40-1 assume !!(main_~i~1 < main_~n~0); 502#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 530#L41-1 havoc main_#t~nondet21; 492#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 493#L40-4 assume true; 500#L40-1 assume !(main_~i~1 < main_~n~0); 487#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 518#merge_sortENTRY [2018-11-10 08:44:06,687 INFO L795 eck$LassoCheckResult]: Loop: 518#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 494#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 486#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 518#merge_sortENTRY [2018-11-10 08:44:06,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:06,687 INFO L82 PathProgramCache]: Analyzing trace with hash 236915770, now seen corresponding path program 2 times [2018-11-10 08:44:06,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:06,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:06,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:06,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:06,704 INFO L82 PathProgramCache]: Analyzing trace with hash 30020, now seen corresponding path program 3 times [2018-11-10 08:44:06,704 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:06,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:06,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:06,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1326436971, now seen corresponding path program 2 times [2018-11-10 08:44:06,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:06,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:06,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:06,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:06,974 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-11-10 08:44:07,098 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:44:07,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:44:07,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:44:07,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:44:07,098 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:44:07,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:44:07,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:44:07,099 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:44:07,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration4_Lasso [2018-11-10 08:44:07,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:44:07,099 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:44:07,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,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-11-10 08:44:07,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-11-10 08:44:07,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:07,332 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:44:07,332 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:44:07,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,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-11-10 08:44:07,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:07,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:07,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:07,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:07,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:07,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,369 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:44:07,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,370 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:44:07,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:07,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:07,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:07,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:07,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:07,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:07,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:07,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:07,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:07,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:07,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:07,393 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:44:07,396 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:44:07,396 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 08:44:07,396 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:44:07,397 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:44:07,397 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:44:07,398 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2018-11-10 08:44:07,404 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 08:44:07,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:07,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:07,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:07,527 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 08:44:07,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 60 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 08:44:07,597 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 60 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 70 states and 82 transitions. Complement of second has 12 states. [2018-11-10 08:44:07,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:44:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:44:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-10 08:44:07,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-10 08:44:07,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:07,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-10 08:44:07,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:07,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-10 08:44:07,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:07,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 82 transitions. [2018-11-10 08:44:07,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 08:44:07,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 61 states and 73 transitions. [2018-11-10 08:44:07,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:44:07,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 08:44:07,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 73 transitions. [2018-11-10 08:44:07,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:07,604 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-11-10 08:44:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 73 transitions. [2018-11-10 08:44:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-10 08:44:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 08:44:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-11-10 08:44:07,610 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-10 08:44:07,610 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-10 08:44:07,610 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 08:44:07,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 69 transitions. [2018-11-10 08:44:07,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 08:44:07,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:07,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:07,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:07,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:07,612 INFO L793 eck$LassoCheckResult]: Stem: 748#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 728#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 739#L40-4 assume true; 718#L40-1 assume !!(main_~i~1 < main_~n~0); 719#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 747#L41-1 havoc main_#t~nondet21; 708#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 709#L40-4 assume true; 740#L40-1 assume !!(main_~i~1 < main_~n~0); 756#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 755#L41-1 havoc main_#t~nondet21; 754#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 753#L40-4 assume true; 717#L40-1 assume !(main_~i~1 < main_~n~0); 703#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 736#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 712#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 702#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 751#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 710#L24 assume ~n < 2; 711#merge_sortFINAL assume true; 729#merge_sortEXIT >#106#return; 701#L27-1 [2018-11-10 08:44:07,612 INFO L795 eck$LassoCheckResult]: Loop: 701#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 750#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 757#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 704#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 750#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 757#L24 assume ~n < 2; 733#merge_sortFINAL assume true; 758#merge_sortEXIT >#106#return; 701#L27-1 [2018-11-10 08:44:07,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash -994395731, now seen corresponding path program 1 times [2018-11-10 08:44:07,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:07,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:07,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:07,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:07,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:07,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:07,640 INFO L82 PathProgramCache]: Analyzing trace with hash 201149277, now seen corresponding path program 1 times [2018-11-10 08:44:07,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:07,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:07,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:07,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1997956855, now seen corresponding path program 1 times [2018-11-10 08:44:07,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:07,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:07,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:44:07,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:07,759 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:07,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:07,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:07,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:44:07,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-10 08:44:08,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 08:44:08,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:44:08,058 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. cyclomatic complexity: 15 Second operand 13 states. [2018-11-10 08:44:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:08,153 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2018-11-10 08:44:08,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 08:44:08,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 133 transitions. [2018-11-10 08:44:08,156 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 56 [2018-11-10 08:44:08,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 112 states and 128 transitions. [2018-11-10 08:44:08,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2018-11-10 08:44:08,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-10 08:44:08,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 128 transitions. [2018-11-10 08:44:08,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:08,159 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2018-11-10 08:44:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 128 transitions. [2018-11-10 08:44:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-11-10 08:44:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 08:44:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-11-10 08:44:08,166 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-11-10 08:44:08,166 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-11-10 08:44:08,166 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 08:44:08,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 124 transitions. [2018-11-10 08:44:08,167 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 56 [2018-11-10 08:44:08,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:08,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:08,168 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:08,168 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:08,169 INFO L793 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1021#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1022#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1033#L40-4 assume true; 1012#L40-1 assume !!(main_~i~1 < main_~n~0); 1013#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 1041#L41-1 havoc main_#t~nondet21; 1002#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 1003#L40-4 assume true; 1034#L40-1 assume !!(main_~i~1 < main_~n~0); 1077#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 1076#L41-1 havoc main_#t~nondet21; 1074#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 1070#L40-4 assume true; 1058#L40-1 assume !!(main_~i~1 < main_~n~0); 1064#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 1062#L41-1 havoc main_#t~nondet21; 1059#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 1057#L40-4 assume true; 1056#L40-1 assume !(main_~i~1 < main_~n~0); 997#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1052#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1006#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 994#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1047#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1048#L24 assume ~n < 2; 1098#merge_sortFINAL assume true; 1042#merge_sortEXIT >#106#return; 996#L27-1 [2018-11-10 08:44:08,169 INFO L795 eck$LassoCheckResult]: Loop: 996#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 1046#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1004#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 995#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1046#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1004#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 995#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1046#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1004#L24 assume ~n < 2; 1005#merge_sortFINAL assume true; 1023#merge_sortEXIT >#106#return; 996#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 1046#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1004#L24 assume ~n < 2; 1005#merge_sortFINAL assume true; 1023#merge_sortEXIT >#108#return; 1028#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1029#L11-4 assume true; 1018#L11-1 assume !(merge_~k~0 < merge_~n); 1020#L11-5 merge_~i~0 := 0; 1055#L17-4 assume true; 1053#L17-1 assume !(merge_~i~0 < merge_~n); 1016#L17-5 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := merge_~x~0.base, merge_~x~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 1017#L8 assume { :end_inline_merge } true; 1027#merge_sortFINAL assume true; 1100#merge_sortEXIT >#106#return; 996#L27-1 [2018-11-10 08:44:08,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:08,173 INFO L82 PathProgramCache]: Analyzing trace with hash -156950617, now seen corresponding path program 2 times [2018-11-10 08:44:08,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:08,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:08,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:08,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:08,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1657214637, now seen corresponding path program 1 times [2018-11-10 08:44:08,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:08,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:08,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 08:44:08,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:08,244 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:08,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:08,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 08:44:08,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:44:08,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-10 08:44:08,297 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:44:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:44:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:44:08,297 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-10 08:44:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:08,353 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2018-11-10 08:44:08,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:44:08,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 170 transitions. [2018-11-10 08:44:08,355 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 56 [2018-11-10 08:44:08,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 170 transitions. [2018-11-10 08:44:08,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-10 08:44:08,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-10 08:44:08,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 170 transitions. [2018-11-10 08:44:08,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:08,358 INFO L705 BuchiCegarLoop]: Abstraction has 148 states and 170 transitions. [2018-11-10 08:44:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 170 transitions. [2018-11-10 08:44:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2018-11-10 08:44:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 08:44:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2018-11-10 08:44:08,367 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2018-11-10 08:44:08,367 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2018-11-10 08:44:08,367 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 08:44:08,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 128 transitions. [2018-11-10 08:44:08,368 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 56 [2018-11-10 08:44:08,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:08,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:08,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:08,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:08,371 INFO L793 eck$LassoCheckResult]: Stem: 1387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1365#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1376#L40-4 assume true; 1356#L40-1 assume !!(main_~i~1 < main_~n~0); 1357#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 1384#L41-1 havoc main_#t~nondet21; 1345#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 1346#L40-4 assume true; 1377#L40-1 assume !!(main_~i~1 < main_~n~0); 1417#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 1416#L41-1 havoc main_#t~nondet21; 1414#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 1413#L40-4 assume true; 1407#L40-1 assume !!(main_~i~1 < main_~n~0); 1411#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 1409#L41-1 havoc main_#t~nondet21; 1408#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 1406#L40-4 assume true; 1404#L40-1 assume !(main_~i~1 < main_~n~0); 1338#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1397#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1350#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 1337#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1393#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1394#L24 assume ~n < 2; 1445#merge_sortFINAL assume true; 1444#merge_sortEXIT >#106#return; 1339#L27-1 [2018-11-10 08:44:08,372 INFO L795 eck$LassoCheckResult]: Loop: 1339#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 1395#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1447#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 1340#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1395#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1447#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 1340#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1395#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1447#L24 assume ~n < 2; 1446#merge_sortFINAL assume true; 1415#merge_sortEXIT >#106#return; 1339#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 1395#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1447#L24 assume ~n < 2; 1446#merge_sortFINAL assume true; 1415#merge_sortEXIT >#108#return; 1371#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1372#L11-4 assume true; 1362#L11-1 assume !!(merge_~k~0 < merge_~n); 1363#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := merge_#t~post3 + 1; 1382#L12-1 SUMMARY for call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post3 * 4, 4); srcloc: L12-1 1383#L12-2 merge_#t~ite15 := merge_#t~mem4; 1369#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 1367#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 1368#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 1405#L11-4 assume true; 1403#L11-1 assume !(merge_~k~0 < merge_~n); 1402#L11-5 merge_~i~0 := 0; 1400#L17-4 assume true; 1398#L17-1 assume !(merge_~i~0 < merge_~n); 1360#L17-5 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := merge_~x~0.base, merge_~x~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 1361#L8 assume { :end_inline_merge } true; 1370#merge_sortFINAL assume true; 1443#merge_sortEXIT >#106#return; 1339#L27-1 [2018-11-10 08:44:08,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash -156950617, now seen corresponding path program 3 times [2018-11-10 08:44:08,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:08,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:08,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1818368465, now seen corresponding path program 1 times [2018-11-10 08:44:08,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:08,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:08,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:08,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 08:44:08,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:08,435 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:08,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:08,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:44:08,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:44:08,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-11-10 08:44:08,606 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:44:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:44:08,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:44:08,607 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. cyclomatic complexity: 23 Second operand 10 states. [2018-11-10 08:44:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:08,903 INFO L93 Difference]: Finished difference Result 218 states and 261 transitions. [2018-11-10 08:44:08,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:44:08,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 261 transitions. [2018-11-10 08:44:08,907 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 143 [2018-11-10 08:44:08,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 218 states and 261 transitions. [2018-11-10 08:44:08,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2018-11-10 08:44:08,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 200 [2018-11-10 08:44:08,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 218 states and 261 transitions. [2018-11-10 08:44:08,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:08,914 INFO L705 BuchiCegarLoop]: Abstraction has 218 states and 261 transitions. [2018-11-10 08:44:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states and 261 transitions. [2018-11-10 08:44:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 140. [2018-11-10 08:44:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 08:44:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2018-11-10 08:44:08,924 INFO L728 BuchiCegarLoop]: Abstraction has 140 states and 162 transitions. [2018-11-10 08:44:08,924 INFO L608 BuchiCegarLoop]: Abstraction has 140 states and 162 transitions. [2018-11-10 08:44:08,924 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 08:44:08,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 162 transitions. [2018-11-10 08:44:08,928 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 84 [2018-11-10 08:44:08,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:08,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:08,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:08,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:08,929 INFO L793 eck$LassoCheckResult]: Stem: 1845#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1820#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1821#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1833#L40-4 assume true; 1812#L40-1 assume !!(main_~i~1 < main_~n~0); 1813#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 1841#L41-1 havoc main_#t~nondet21; 1801#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 1802#L40-4 assume true; 1834#L40-1 assume !!(main_~i~1 < main_~n~0); 1870#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 1868#L41-1 havoc main_#t~nondet21; 1866#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 1860#L40-4 assume true; 1862#L40-1 assume !!(main_~i~1 < main_~n~0); 1871#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 1869#L41-1 havoc main_#t~nondet21; 1867#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 1865#L40-4 assume true; 1811#L40-1 assume !(main_~i~1 < main_~n~0); 1795#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1859#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1806#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 1796#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1854#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1855#L24 assume ~n < 2; 1877#merge_sortFINAL assume true; 1875#merge_sortEXIT >#106#return; 1793#L27-1 [2018-11-10 08:44:08,929 INFO L795 eck$LassoCheckResult]: Loop: 1793#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 1876#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1863#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 1794#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1876#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1863#L24 assume ~n < 2; 1864#merge_sortFINAL assume true; 1878#merge_sortEXIT >#106#return; 1793#L27-1 [2018-11-10 08:44:08,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash -156950617, now seen corresponding path program 4 times [2018-11-10 08:44:08,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:08,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:08,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:08,974 INFO L82 PathProgramCache]: Analyzing trace with hash 201149277, now seen corresponding path program 2 times [2018-11-10 08:44:08,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:08,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:08,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:08,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:08,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash -76323581, now seen corresponding path program 2 times [2018-11-10 08:44:08,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:08,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:08,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:08,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:09,452 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2018-11-10 08:44:09,616 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2018-11-10 08:44:09,641 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:44:09,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:44:09,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:44:09,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:44:09,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:44:09,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:44:09,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:44:09,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:44:09,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration8_Lasso [2018-11-10 08:44:09,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:44:09,642 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:44:09,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,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-11-10 08:44:09,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,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-11-10 08:44:09,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-11-10 08:44:09,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-11-10 08:44:09,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:09,969 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:44:09,970 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:44:09,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-11-10 08:44:09,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,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-11-10 08:44:09,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:09,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:09,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:09,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:09,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:09,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:09,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:09,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:09,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:09,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:09,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:09,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:10,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:10,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:10,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:10,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:10,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:10,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:10,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:10,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:10,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,056 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:44:10,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,057 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:44:10,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:10,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:10,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:10,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:10,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:10,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:10,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:10,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:10,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:10,087 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:44:10,115 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 08:44:10,115 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 08:44:10,116 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:44:10,117 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:44:10,117 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:44:10,117 INFO L519 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-11-10 08:44:10,117 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:44:10,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:10,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:10,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:10,328 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-11-10 08:44:10,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 162 transitions. cyclomatic complexity: 31 Second operand 7 states. [2018-11-10 08:44:10,464 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 162 transitions. cyclomatic complexity: 31. Second operand 7 states. Result 814 states and 974 transitions. Complement of second has 28 states. [2018-11-10 08:44:10,465 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-11-10 08:44:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 08:44:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-10 08:44:10,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 105 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-10 08:44:10,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:10,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 105 transitions. Stem has 36 letters. Loop has 8 letters. [2018-11-10 08:44:10,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:10,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 105 transitions. Stem has 28 letters. Loop has 16 letters. [2018-11-10 08:44:10,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:10,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 814 states and 974 transitions. [2018-11-10 08:44:10,480 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 328 [2018-11-10 08:44:10,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 814 states to 566 states and 686 transitions. [2018-11-10 08:44:10,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 427 [2018-11-10 08:44:10,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 430 [2018-11-10 08:44:10,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 566 states and 686 transitions. [2018-11-10 08:44:10,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:10,487 INFO L705 BuchiCegarLoop]: Abstraction has 566 states and 686 transitions. [2018-11-10 08:44:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states and 686 transitions. [2018-11-10 08:44:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 513. [2018-11-10 08:44:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-10 08:44:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 616 transitions. [2018-11-10 08:44:10,508 INFO L728 BuchiCegarLoop]: Abstraction has 513 states and 616 transitions. [2018-11-10 08:44:10,508 INFO L608 BuchiCegarLoop]: Abstraction has 513 states and 616 transitions. [2018-11-10 08:44:10,508 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 08:44:10,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 513 states and 616 transitions. [2018-11-10 08:44:10,512 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 288 [2018-11-10 08:44:10,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:10,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:10,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:10,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:10,514 INFO L793 eck$LassoCheckResult]: Stem: 3013#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2963#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 2964#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 2987#L40-4 assume true; 2988#L40-1 assume !!(main_~i~1 < main_~n~0); 3069#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 3068#L41-1 havoc main_#t~nondet21; 3067#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 3066#L40-4 assume true; 3065#L40-1 assume !!(main_~i~1 < main_~n~0); 3064#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 3063#L41-1 havoc main_#t~nondet21; 3062#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 3061#L40-4 assume true; 3060#L40-1 assume !(main_~i~1 < main_~n~0); 2912#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 2980#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3115#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 3029#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 3030#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3119#L24 assume ~n < 2; 3118#merge_sortFINAL assume true; 3117#merge_sortEXIT >#106#return; 3012#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 3025#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3026#L24 assume ~n < 2; 3371#merge_sortFINAL assume true; 3011#merge_sortEXIT >#108#return; 2976#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 2977#L11-4 assume true; 2959#L11-1 assume !!(merge_~k~0 < merge_~n); 2960#L12 [2018-11-10 08:44:10,514 INFO L795 eck$LassoCheckResult]: Loop: 2960#L12 assume !(merge_~j~0 == merge_~n); 3005#L13 assume !(merge_~i~0 == merge_~m); 3421#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 2993#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 2994#L14-2 assume !(merge_#t~mem7 < merge_#t~mem8);merge_#t~post11 := merge_~i~0;merge_~i~0 := merge_#t~post11 + 1; 3006#L15 SUMMARY for call merge_#t~mem12 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post11 * 4, 4); srcloc: L15 3419#L15-1 merge_#t~ite13 := merge_#t~mem12; 3418#L14-6 merge_#t~ite14 := merge_#t~ite13; 3417#L13-4 merge_#t~ite15 := merge_#t~ite14; 3416#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 3415#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 3414#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 3413#L11-4 assume true; 3276#L11-1 assume !!(merge_~k~0 < merge_~n); 2960#L12 [2018-11-10 08:44:10,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2051072438, now seen corresponding path program 1 times [2018-11-10 08:44:10,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:10,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:10,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:10,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:10,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1515279445, now seen corresponding path program 1 times [2018-11-10 08:44:10,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:10,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:10,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:10,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1143652642, now seen corresponding path program 1 times [2018-11-10 08:44:10,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:10,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:10,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:10,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:10,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:10,709 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-11-10 08:44:11,052 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 125 [2018-11-10 08:44:11,201 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-11-10 08:44:11,538 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 131 [2018-11-10 08:44:11,617 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:44:11,617 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:44:11,617 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:44:11,617 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:44:11,617 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:44:11,617 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:44:11,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:44:11,617 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:44:11,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration9_Lasso [2018-11-10 08:44:11,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:44:11,617 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:44:11,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-11-10 08:44:11,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:11,931 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 129 [2018-11-10 08:44:12,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:12,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:12,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:12,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:12,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:12,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:12,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-11-10 08:44:12,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-11-10 08:44:12,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-11-10 08:44:12,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:12,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-11-10 08:44:12,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:12,302 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2018-11-10 08:44:12,643 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-10 08:44:12,656 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:44:12,656 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:44:12,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:12,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:12,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:12,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:12,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:12,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:12,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:12,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,720 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:44:12,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,721 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:44:12,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:12,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:12,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:12,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:12,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,747 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:44:12,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:12,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,748 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:44:12,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:12,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:12,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:12,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:12,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:12,753 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 08:44:12,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:12,794 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-10 08:44:12,794 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-10 08:44:16,280 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:44:17,203 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2018-11-10 08:44:17,203 INFO L444 ModelExtractionUtils]: 217 out of 244 variables were initially zero. Simplification set additionally 23 variables to zero. [2018-11-10 08:44:17,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:44:17,206 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2018-11-10 08:44:17,207 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:44:17,207 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, v_rep(select #length merge_sort_#in~a.base)_3, merge_sort_merge_~i~0) = -1*merge_sort_merge_~a.offset + 1*v_rep(select #length merge_sort_#in~a.base)_3 - 4*merge_sort_merge_~i~0 Supporting invariants [] [2018-11-10 08:44:17,244 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 08:44:17,246 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 08:44:17,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:17,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:17,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:17,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-10 08:44:17,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 513 states and 616 transitions. cyclomatic complexity: 136 Second operand 8 states. [2018-11-10 08:44:17,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 513 states and 616 transitions. cyclomatic complexity: 136. Second operand 8 states. Result 1291 states and 1564 transitions. Complement of second has 18 states. [2018-11-10 08:44:17,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:44:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 08:44:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-10 08:44:17,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 63 transitions. Stem has 31 letters. Loop has 14 letters. [2018-11-10 08:44:17,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:17,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 63 transitions. Stem has 45 letters. Loop has 14 letters. [2018-11-10 08:44:17,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:17,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 63 transitions. Stem has 31 letters. Loop has 28 letters. [2018-11-10 08:44:17,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:17,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1564 transitions. [2018-11-10 08:44:17,563 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 392 [2018-11-10 08:44:17,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1275 states and 1540 transitions. [2018-11-10 08:44:17,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2018-11-10 08:44:17,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 642 [2018-11-10 08:44:17,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1275 states and 1540 transitions. [2018-11-10 08:44:17,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:17,581 INFO L705 BuchiCegarLoop]: Abstraction has 1275 states and 1540 transitions. [2018-11-10 08:44:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states and 1540 transitions. [2018-11-10 08:44:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1185. [2018-11-10 08:44:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-11-10 08:44:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1436 transitions. [2018-11-10 08:44:17,612 INFO L728 BuchiCegarLoop]: Abstraction has 1185 states and 1436 transitions. [2018-11-10 08:44:17,612 INFO L608 BuchiCegarLoop]: Abstraction has 1185 states and 1436 transitions. [2018-11-10 08:44:17,612 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 08:44:17,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1185 states and 1436 transitions. [2018-11-10 08:44:17,618 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 392 [2018-11-10 08:44:17,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:17,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:17,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:17,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:17,619 INFO L793 eck$LassoCheckResult]: Stem: 5070#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5000#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 5001#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 5035#L40-4 assume true; 5036#L40-1 assume !!(main_~i~1 < main_~n~0); 5110#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 5109#L41-1 havoc main_#t~nondet21; 5108#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 5037#L40-4 assume true; 4984#L40-1 assume !!(main_~i~1 < main_~n~0); 4985#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 5057#L41-1 havoc main_#t~nondet21; 5058#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 5105#L40-4 assume true; 5107#L40-1 assume !(main_~i~1 < main_~n~0); 5024#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 5025#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5390#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 5388#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5389#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5398#L24 assume ~n < 2; 5395#merge_sortFINAL assume true; 5391#merge_sortEXIT >#106#return; 5392#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 5588#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5598#L24 assume ~n < 2; 5597#merge_sortFINAL assume true; 5585#merge_sortEXIT >#108#return; 5582#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 5579#L11-4 assume true; 5576#L11-1 assume !!(merge_~k~0 < merge_~n); 5573#L12 assume !(merge_~j~0 == merge_~n); 5535#L13 [2018-11-10 08:44:17,619 INFO L795 eck$LassoCheckResult]: Loop: 5535#L13 assume merge_~i~0 == merge_~m;merge_#t~post5 := merge_~j~0;merge_~j~0 := merge_#t~post5 + 1; 5554#L13-1 SUMMARY for call merge_#t~mem6 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post5 * 4, 4); srcloc: L13-1 5550#L13-2 merge_#t~ite14 := merge_#t~mem6; 5546#L13-4 merge_#t~ite15 := merge_#t~ite14; 5526#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 5543#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 5541#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 5539#L11-4 assume true; 5537#L11-1 assume !!(merge_~k~0 < merge_~n); 5534#L12 assume !(merge_~j~0 == merge_~n); 5535#L13 [2018-11-10 08:44:17,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash 841263885, now seen corresponding path program 1 times [2018-11-10 08:44:17,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:17,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:17,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:17,637 INFO L82 PathProgramCache]: Analyzing trace with hash 60443412, now seen corresponding path program 1 times [2018-11-10 08:44:17,637 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:17,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:17,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:17,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:17,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1763862752, now seen corresponding path program 1 times [2018-11-10 08:44:17,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:17,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:17,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:17,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 08:44:17,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:44:17,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:44:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:44:17,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:44:17,735 INFO L87 Difference]: Start difference. First operand 1185 states and 1436 transitions. cyclomatic complexity: 315 Second operand 4 states. [2018-11-10 08:44:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:17,760 INFO L93 Difference]: Finished difference Result 1263 states and 1518 transitions. [2018-11-10 08:44:17,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:44:17,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1263 states and 1518 transitions. [2018-11-10 08:44:17,768 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 425 [2018-11-10 08:44:17,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1263 states to 1263 states and 1518 transitions. [2018-11-10 08:44:17,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 644 [2018-11-10 08:44:17,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 644 [2018-11-10 08:44:17,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1263 states and 1518 transitions. [2018-11-10 08:44:17,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:17,775 INFO L705 BuchiCegarLoop]: Abstraction has 1263 states and 1518 transitions. [2018-11-10 08:44:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states and 1518 transitions. [2018-11-10 08:44:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1246. [2018-11-10 08:44:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1246 states. [2018-11-10 08:44:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1501 transitions. [2018-11-10 08:44:17,797 INFO L728 BuchiCegarLoop]: Abstraction has 1246 states and 1501 transitions. [2018-11-10 08:44:17,797 INFO L608 BuchiCegarLoop]: Abstraction has 1246 states and 1501 transitions. [2018-11-10 08:44:17,797 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 08:44:17,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1246 states and 1501 transitions. [2018-11-10 08:44:17,801 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 425 [2018-11-10 08:44:17,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:17,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:17,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:17,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:17,803 INFO L793 eck$LassoCheckResult]: Stem: 7527#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7460#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 7461#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 7490#L40-4 assume true; 7491#L40-1 assume !!(main_~i~1 < main_~n~0); 7560#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 7559#L41-1 havoc main_#t~nondet21; 7558#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 7492#L40-4 assume true; 7441#L40-1 assume !!(main_~i~1 < main_~n~0); 7442#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 7512#L41-1 havoc main_#t~nondet21; 7513#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 7555#L40-4 assume true; 7557#L40-1 assume !(main_~i~1 < main_~n~0); 7432#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 7482#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7605#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 7546#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 7547#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7814#L24 assume ~n < 2; 7813#merge_sortFINAL assume true; 7811#merge_sortEXIT >#106#return; 7805#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 7808#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7816#L24 assume ~n < 2; 7815#merge_sortFINAL assume true; 7804#merge_sortEXIT >#108#return; 7802#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 7800#L11-4 assume true; 7798#L11-1 assume !!(merge_~k~0 < merge_~n); 7795#L12 assume !(merge_~j~0 == merge_~n); 7796#L13 [2018-11-10 08:44:17,803 INFO L795 eck$LassoCheckResult]: Loop: 7796#L13 assume !(merge_~i~0 == merge_~m); 7763#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 7809#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 7803#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 7801#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 7799#L14-4 merge_#t~ite13 := merge_#t~mem10; 7797#L14-6 merge_#t~ite14 := merge_#t~ite13; 7735#L13-4 merge_#t~ite15 := merge_#t~ite14; 7709#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 7676#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 7673#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 7670#L11-4 assume true; 7662#L11-1 assume !!(merge_~k~0 < merge_~n); 7663#L12 assume !(merge_~j~0 == merge_~n); 7796#L13 [2018-11-10 08:44:17,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash 841263885, now seen corresponding path program 2 times [2018-11-10 08:44:17,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:17,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash -543036567, now seen corresponding path program 1 times [2018-11-10 08:44:17,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:17,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:17,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:17,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:17,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1225281909, now seen corresponding path program 1 times [2018-11-10 08:44:17,826 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:17,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 08:44:17,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:17,916 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:17,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:17,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 08:44:18,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:44:18,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-10 08:44:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 08:44:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:44:18,149 INFO L87 Difference]: Start difference. First operand 1246 states and 1501 transitions. cyclomatic complexity: 319 Second operand 14 states. [2018-11-10 08:44:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:18,452 INFO L93 Difference]: Finished difference Result 2366 states and 2925 transitions. [2018-11-10 08:44:18,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 08:44:18,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2366 states and 2925 transitions. [2018-11-10 08:44:18,473 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 770 [2018-11-10 08:44:18,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2366 states to 2270 states and 2813 transitions. [2018-11-10 08:44:18,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1376 [2018-11-10 08:44:18,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1442 [2018-11-10 08:44:18,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2270 states and 2813 transitions. [2018-11-10 08:44:18,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:18,492 INFO L705 BuchiCegarLoop]: Abstraction has 2270 states and 2813 transitions. [2018-11-10 08:44:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states and 2813 transitions. [2018-11-10 08:44:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1169. [2018-11-10 08:44:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-11-10 08:44:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1371 transitions. [2018-11-10 08:44:18,534 INFO L728 BuchiCegarLoop]: Abstraction has 1169 states and 1371 transitions. [2018-11-10 08:44:18,534 INFO L608 BuchiCegarLoop]: Abstraction has 1169 states and 1371 transitions. [2018-11-10 08:44:18,534 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 08:44:18,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1169 states and 1371 transitions. [2018-11-10 08:44:18,540 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 346 [2018-11-10 08:44:18,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:18,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:18,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:18,541 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 08:44:18,541 INFO L793 eck$LassoCheckResult]: Stem: 11324#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 11252#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 11282#L40-4 assume true; 11283#L40-1 assume !!(main_~i~1 < main_~n~0); 11348#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 11347#L41-1 havoc main_#t~nondet21; 11346#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 11284#L40-4 assume true; 11231#L40-1 assume !!(main_~i~1 < main_~n~0); 11232#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 11308#L41-1 havoc main_#t~nondet21; 11309#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 11343#L40-4 assume true; 11344#L40-1 assume !!(main_~i~1 < main_~n~0); 11317#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 11318#L41-1 havoc main_#t~nondet21; 11215#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 11216#L40-4 assume true; 11229#L40-1 assume !(main_~i~1 < main_~n~0); 11230#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 11365#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11364#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 11357#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11360#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11362#L24 assume ~n < 2; 11361#merge_sortFINAL assume true; 11356#merge_sortEXIT >#106#return; 11353#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 11355#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11781#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 11191#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11540#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11541#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 11211#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11351#merge_sortENTRY [2018-11-10 08:44:18,541 INFO L795 eck$LassoCheckResult]: Loop: 11351#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11352#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 11205#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11351#merge_sortENTRY [2018-11-10 08:44:18,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1521558660, now seen corresponding path program 3 times [2018-11-10 08:44:18,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:18,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:18,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:18,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:18,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 08:44:18,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:18,621 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:18,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:44:18,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 08:44:18,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:44:18,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:18,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:44:18,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2018-11-10 08:44:18,801 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:44:18,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash 30020, now seen corresponding path program 4 times [2018-11-10 08:44:18,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:18,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:18,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:18,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:18,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:18,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 08:44:18,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-10 08:44:18,906 INFO L87 Difference]: Start difference. First operand 1169 states and 1371 transitions. cyclomatic complexity: 259 Second operand 18 states. [2018-11-10 08:44:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:19,297 INFO L93 Difference]: Finished difference Result 707 states and 814 transitions. [2018-11-10 08:44:19,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 08:44:19,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 707 states and 814 transitions. [2018-11-10 08:44:19,303 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 309 [2018-11-10 08:44:19,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 707 states to 699 states and 806 transitions. [2018-11-10 08:44:19,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 608 [2018-11-10 08:44:19,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 614 [2018-11-10 08:44:19,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 699 states and 806 transitions. [2018-11-10 08:44:19,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:19,308 INFO L705 BuchiCegarLoop]: Abstraction has 699 states and 806 transitions. [2018-11-10 08:44:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states and 806 transitions. [2018-11-10 08:44:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 476. [2018-11-10 08:44:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-11-10 08:44:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 541 transitions. [2018-11-10 08:44:19,318 INFO L728 BuchiCegarLoop]: Abstraction has 476 states and 541 transitions. [2018-11-10 08:44:19,318 INFO L608 BuchiCegarLoop]: Abstraction has 476 states and 541 transitions. [2018-11-10 08:44:19,318 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 08:44:19,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 476 states and 541 transitions. [2018-11-10 08:44:19,320 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 171 [2018-11-10 08:44:19,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:19,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:19,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:19,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:19,322 INFO L793 eck$LassoCheckResult]: Stem: 13289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 13252#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 13269#L40-4 assume true; 13240#L40-1 assume !!(main_~i~1 < main_~n~0); 13241#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 13283#L41-1 havoc main_#t~nondet21; 13227#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 13228#L40-4 assume true; 13270#L40-1 assume !!(main_~i~1 < main_~n~0); 13323#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 13319#L41-1 havoc main_#t~nondet21; 13320#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 13312#L40-4 assume true; 13314#L40-1 assume !(main_~i~1 < main_~n~0); 13223#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 13264#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13346#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 13298#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 13297#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13299#L24 assume ~n < 2; 13348#merge_sortFINAL assume true; 13349#merge_sortEXIT >#106#return; 13330#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 13331#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13335#L24 assume ~n < 2; 13336#merge_sortFINAL assume true; 13329#merge_sortEXIT >#108#return; 13328#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 13327#L11-4 assume true; 13326#L11-1 assume !!(merge_~k~0 < merge_~n); 13324#L12 assume !(merge_~j~0 == merge_~n); 13236#L13 assume !(merge_~i~0 == merge_~m); 13237#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 13272#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 13275#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 13282#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 13627#L14-4 merge_#t~ite13 := merge_#t~mem10; 13625#L14-6 merge_#t~ite14 := merge_#t~ite13; 13623#L13-4 merge_#t~ite15 := merge_#t~ite14; 13621#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 13620#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 13618#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 13616#L11-4 assume true; 13614#L11-1 assume !!(merge_~k~0 < merge_~n); 13612#L12 [2018-11-10 08:44:19,322 INFO L795 eck$LassoCheckResult]: Loop: 13612#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := merge_#t~post3 + 1; 13611#L12-1 SUMMARY for call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post3 * 4, 4); srcloc: L12-1 13607#L12-2 merge_#t~ite15 := merge_#t~mem4; 13608#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 13619#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 13617#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 13615#L11-4 assume true; 13613#L11-1 assume !!(merge_~k~0 < merge_~n); 13612#L12 [2018-11-10 08:44:19,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:19,322 INFO L82 PathProgramCache]: Analyzing trace with hash -99022110, now seen corresponding path program 2 times [2018-11-10 08:44:19,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:19,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:19,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:19,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1837495997, now seen corresponding path program 1 times [2018-11-10 08:44:19,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:19,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:19,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:19,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:19,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:19,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:19,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1611572004, now seen corresponding path program 1 times [2018-11-10 08:44:19,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:19,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:19,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:19,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:19,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 08:44:19,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:19,508 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:19,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:44:19,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:44:19,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-10 08:44:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 08:44:19,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-10 08:44:19,710 INFO L87 Difference]: Start difference. First operand 476 states and 541 transitions. cyclomatic complexity: 88 Second operand 20 states. [2018-11-10 08:44:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:20,037 INFO L93 Difference]: Finished difference Result 760 states and 845 transitions. [2018-11-10 08:44:20,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 08:44:20,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 760 states and 845 transitions. [2018-11-10 08:44:20,042 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 188 [2018-11-10 08:44:20,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 760 states to 709 states and 794 transitions. [2018-11-10 08:44:20,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 627 [2018-11-10 08:44:20,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 684 [2018-11-10 08:44:20,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 709 states and 794 transitions. [2018-11-10 08:44:20,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:20,049 INFO L705 BuchiCegarLoop]: Abstraction has 709 states and 794 transitions. [2018-11-10 08:44:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states and 794 transitions. [2018-11-10 08:44:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 504. [2018-11-10 08:44:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-10 08:44:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 568 transitions. [2018-11-10 08:44:20,060 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 568 transitions. [2018-11-10 08:44:20,060 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 568 transitions. [2018-11-10 08:44:20,060 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 08:44:20,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 568 transitions. [2018-11-10 08:44:20,063 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 103 [2018-11-10 08:44:20,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:20,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:20,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:20,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:44:20,064 INFO L793 eck$LassoCheckResult]: Stem: 14724#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14692#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 14693#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 14705#L40-4 assume true; 14706#L40-1 assume !!(main_~i~1 < main_~n~0); 14720#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 14721#L41-1 havoc main_#t~nondet21; 14669#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 14670#L40-4 assume true; 14681#L40-1 assume !!(main_~i~1 < main_~n~0); 14682#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 14715#L41-1 havoc main_#t~nondet21; 14716#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 14756#L40-4 assume true; 14757#L40-1 assume !(main_~i~1 < main_~n~0); 14676#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 14702#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 14760#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 14864#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 14865#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 14973#L24 assume ~n < 2; 14972#merge_sortFINAL assume true; 14863#merge_sortEXIT >#106#return; 14732#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 14731#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 14733#L24 assume ~n < 2; 14971#merge_sortFINAL assume true; 14970#merge_sortEXIT >#108#return; 14911#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 14969#L11-4 assume true; 14968#L11-1 assume !!(merge_~k~0 < merge_~n); 14966#L12 assume !(merge_~j~0 == merge_~n); 14965#L13 assume !(merge_~i~0 == merge_~m); 14964#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 14963#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 14961#L14-2 assume !(merge_#t~mem7 < merge_#t~mem8);merge_#t~post11 := merge_~i~0;merge_~i~0 := merge_#t~post11 + 1; 14962#L15 SUMMARY for call merge_#t~mem12 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post11 * 4, 4); srcloc: L15 15036#L15-1 merge_#t~ite13 := merge_#t~mem12; 15035#L14-6 merge_#t~ite14 := merge_#t~ite13; 15034#L13-4 merge_#t~ite15 := merge_#t~ite14; 15033#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 15032#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 15031#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 15030#L11-4 assume true; 15029#L11-1 assume !(merge_~k~0 < merge_~n); 14871#L11-5 merge_~i~0 := 0; 14675#L17-4 [2018-11-10 08:44:20,064 INFO L795 eck$LassoCheckResult]: Loop: 14675#L17-4 assume true; 14677#L17-1 assume !!(merge_~i~0 < merge_~n); 14704#L18 SUMMARY for call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + merge_~i~0 * 4, 4); srcloc: L18 14876#L18-1 SUMMARY for call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L18-1 14873#L18-2 havoc merge_#t~mem17; 14870#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := merge_#t~post16 + 1;havoc merge_#t~post16; 14675#L17-4 [2018-11-10 08:44:20,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:20,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1093493542, now seen corresponding path program 1 times [2018-11-10 08:44:20,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:20,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:20,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:20,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 08:44:20,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:20,104 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:20,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:20,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 08:44:20,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:44:20,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-10 08:44:20,196 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:44:20,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:20,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1686819831, now seen corresponding path program 1 times [2018-11-10 08:44:20,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:20,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:20,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:20,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:20,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:44:20,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:44:20,241 INFO L87 Difference]: Start difference. First operand 504 states and 568 transitions. cyclomatic complexity: 77 Second operand 7 states. [2018-11-10 08:44:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:20,299 INFO L93 Difference]: Finished difference Result 639 states and 701 transitions. [2018-11-10 08:44:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:44:20,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 639 states and 701 transitions. [2018-11-10 08:44:20,303 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 103 [2018-11-10 08:44:20,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 639 states to 600 states and 662 transitions. [2018-11-10 08:44:20,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 575 [2018-11-10 08:44:20,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2018-11-10 08:44:20,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 600 states and 662 transitions. [2018-11-10 08:44:20,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:20,308 INFO L705 BuchiCegarLoop]: Abstraction has 600 states and 662 transitions. [2018-11-10 08:44:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 662 transitions. [2018-11-10 08:44:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 543. [2018-11-10 08:44:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-11-10 08:44:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 599 transitions. [2018-11-10 08:44:20,319 INFO L728 BuchiCegarLoop]: Abstraction has 543 states and 599 transitions. [2018-11-10 08:44:20,319 INFO L608 BuchiCegarLoop]: Abstraction has 543 states and 599 transitions. [2018-11-10 08:44:20,319 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 08:44:20,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 543 states and 599 transitions. [2018-11-10 08:44:20,322 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 103 [2018-11-10 08:44:20,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:20,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:20,323 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:20,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:44:20,323 INFO L793 eck$LassoCheckResult]: Stem: 16022#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 15987#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 16001#L40-4 assume true; 16002#L40-1 assume !!(main_~i~1 < main_~n~0); 16017#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 16018#L41-1 havoc main_#t~nondet21; 15963#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 15964#L40-4 assume true; 15977#L40-1 assume !!(main_~i~1 < main_~n~0); 15978#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 16013#L41-1 havoc main_#t~nondet21; 16014#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 16052#L40-4 assume true; 15975#L40-1 assume !(main_~i~1 < main_~n~0); 15976#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 15997#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 16239#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 16235#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 16236#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 16241#L24 assume ~n < 2; 16238#merge_sortFINAL assume true; 16234#merge_sortEXIT >#106#return; 16140#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 16143#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 16230#L24 assume ~n < 2; 16229#merge_sortFINAL assume true; 16139#merge_sortEXIT >#108#return; 16135#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 16133#L11-4 assume true; 16131#L11-1 assume !!(merge_~k~0 < merge_~n); 16129#L12 assume !(merge_~j~0 == merge_~n); 16127#L13 assume !(merge_~i~0 == merge_~m); 16125#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 16123#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 16120#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 16118#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 16116#L14-4 merge_#t~ite13 := merge_#t~mem10; 16113#L14-6 merge_#t~ite14 := merge_#t~ite13; 16111#L13-4 merge_#t~ite15 := merge_#t~ite14; 16108#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 16105#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 16103#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 16101#L11-4 assume true; 16099#L11-1 assume !!(merge_~k~0 < merge_~n); 16097#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := merge_#t~post3 + 1; 16095#L12-1 SUMMARY for call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post3 * 4, 4); srcloc: L12-1 16087#L12-2 merge_#t~ite15 := merge_#t~mem4; 16083#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 16078#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 16074#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 16068#L11-4 assume true; 16066#L11-1 assume !(merge_~k~0 < merge_~n); 16064#L11-5 merge_~i~0 := 0; 16060#L17-4 [2018-11-10 08:44:20,323 INFO L795 eck$LassoCheckResult]: Loop: 16060#L17-4 assume true; 15999#L17-1 assume !!(merge_~i~0 < merge_~n); 16000#L18 SUMMARY for call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + merge_~i~0 * 4, 4); srcloc: L18 16067#L18-1 SUMMARY for call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L18-1 16065#L18-2 havoc merge_#t~mem17; 16063#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := merge_#t~post16 + 1;havoc merge_#t~post16; 16060#L17-4 [2018-11-10 08:44:20,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:20,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1580875436, now seen corresponding path program 1 times [2018-11-10 08:44:20,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:20,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:20,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:20,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:20,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:20,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1686819831, now seen corresponding path program 2 times [2018-11-10 08:44:20,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:20,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:20,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:20,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash -825531620, now seen corresponding path program 1 times [2018-11-10 08:44:20,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:20,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:21,186 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 204 [2018-11-10 08:44:21,475 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2018-11-10 08:44:21,706 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-10 08:44:22,227 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 152 [2018-11-10 08:44:22,357 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-10 08:44:22,359 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:44:22,359 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:44:22,359 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:44:22,359 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:44:22,359 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:44:22,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:44:22,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:44:22,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:44:22,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration15_Lasso [2018-11-10 08:44:22,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:44:22,359 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:44:22,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,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-11-10 08:44:22,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-11-10 08:44:22,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,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-11-10 08:44:22,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,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-11-10 08:44:22,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-11-10 08:44:22,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-11-10 08:44:22,803 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 143 [2018-11-10 08:44:22,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:22,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:23,091 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-11-10 08:44:23,442 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:44:23,442 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:44:23,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:23,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:23,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:44:23,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:44:23,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:44:23,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:23,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:23,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:23,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:23,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:44:23,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:44:23,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:44:23,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:44:23,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:44:23,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:44:23,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:44:23,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:44:23,535 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:44:23,568 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 08:44:23,568 INFO L444 ModelExtractionUtils]: 66 out of 76 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 08:44:23,569 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:44:23,569 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:44:23,570 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:44:23,570 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, merge_sort_merge_~i~0, v_rep(select #length merge_sort_merge_~a.base)_2) = -1*merge_sort_merge_~a.offset - 4*merge_sort_merge_~i~0 + 1*v_rep(select #length merge_sort_merge_~a.base)_2 Supporting invariants [] [2018-11-10 08:44:23,806 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-10 08:44:23,807 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 08:44:23,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:23,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:23,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:44:23,911 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-11-10 08:44:23,912 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 543 states and 599 transitions. cyclomatic complexity: 69 Second operand 5 states. [2018-11-10 08:44:23,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 543 states and 599 transitions. cyclomatic complexity: 69. Second operand 5 states. Result 569 states and 628 transitions. Complement of second has 14 states. [2018-11-10 08:44:23,973 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-11-10 08:44:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:44:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-10 08:44:23,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 54 letters. Loop has 6 letters. [2018-11-10 08:44:23,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:23,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 60 letters. Loop has 6 letters. [2018-11-10 08:44:23,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:23,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 54 letters. Loop has 12 letters. [2018-11-10 08:44:23,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:44:23,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 569 states and 628 transitions. [2018-11-10 08:44:23,981 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 85 [2018-11-10 08:44:23,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 569 states to 466 states and 518 transitions. [2018-11-10 08:44:23,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 427 [2018-11-10 08:44:23,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 429 [2018-11-10 08:44:23,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 466 states and 518 transitions. [2018-11-10 08:44:23,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:23,987 INFO L705 BuchiCegarLoop]: Abstraction has 466 states and 518 transitions. [2018-11-10 08:44:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states and 518 transitions. [2018-11-10 08:44:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-11-10 08:44:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-11-10 08:44:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 518 transitions. [2018-11-10 08:44:23,998 INFO L728 BuchiCegarLoop]: Abstraction has 466 states and 518 transitions. [2018-11-10 08:44:23,999 INFO L608 BuchiCegarLoop]: Abstraction has 466 states and 518 transitions. [2018-11-10 08:44:23,999 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 08:44:23,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 466 states and 518 transitions. [2018-11-10 08:44:24,001 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 85 [2018-11-10 08:44:24,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:24,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:24,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:24,003 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:24,003 INFO L793 eck$LassoCheckResult]: Stem: 17419#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 17386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 17387#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 17404#L40-4 assume true; 17405#L40-1 assume !!(main_~i~1 < main_~n~0); 17450#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 17449#L41-1 havoc main_#t~nondet21; 17359#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 17360#L40-4 assume true; 17376#L40-1 assume !!(main_~i~1 < main_~n~0); 17377#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 17414#L41-1 havoc main_#t~nondet21; 17415#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 17448#L40-4 assume true; 17447#L40-1 assume !!(main_~i~1 < main_~n~0); 17445#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 17443#L41-1 havoc main_#t~nondet21; 17441#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 17435#L40-4 assume true; 17437#L40-1 assume !(main_~i~1 < main_~n~0); 17367#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 17398#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 17541#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 17535#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 17539#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 17429#L24 assume ~n < 2; 17538#merge_sortFINAL assume true; 17534#merge_sortEXIT >#106#return; 17356#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 17542#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 17540#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 17533#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 17536#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 17544#L24 assume ~n < 2; 17537#merge_sortFINAL assume true; 17532#merge_sortEXIT >#106#return; 17527#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 17529#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 17547#L24 assume ~n < 2; 17545#merge_sortFINAL assume true; 17526#merge_sortEXIT >#108#return; 17528#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 17637#L11-4 assume true; 17636#L11-1 assume !!(merge_~k~0 < merge_~n); 17635#L12 assume !(merge_~j~0 == merge_~n); 17634#L13 assume !(merge_~i~0 == merge_~m); 17633#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 17632#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 17631#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 17630#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 17629#L14-4 merge_#t~ite13 := merge_#t~mem10; 17628#L14-6 merge_#t~ite14 := merge_#t~ite13; 17627#L13-4 merge_#t~ite15 := merge_#t~ite14; 17626#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 17625#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 17487#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 17481#L11-4 assume true; 17474#L11-1 assume !!(merge_~k~0 < merge_~n); 17468#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := merge_#t~post3 + 1; 17463#L12-1 SUMMARY for call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post3 * 4, 4); srcloc: L12-1 17464#L12-2 merge_#t~ite15 := merge_#t~mem4; 17610#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 17608#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 17457#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 17456#L11-4 assume true; 17454#L11-1 assume !(merge_~k~0 < merge_~n); 17452#L11-5 merge_~i~0 := 0; 17453#L17-4 assume true; 17400#L17-1 assume !(merge_~i~0 < merge_~n); 17401#L17-5 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := merge_~x~0.base, merge_~x~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 17394#L8 assume { :end_inline_merge } true; 17395#merge_sortFINAL assume true; 17725#merge_sortEXIT >#108#return; 17396#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 17397#L11-4 assume true; 17384#L11-1 assume !!(merge_~k~0 < merge_~n); 17385#L12 assume !(merge_~j~0 == merge_~n); 17366#L13 assume !(merge_~i~0 == merge_~m); 17368#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 17406#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 17407#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 17412#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 17807#L14-4 merge_#t~ite13 := merge_#t~mem10; 17806#L14-6 merge_#t~ite14 := merge_#t~ite13; 17804#L13-4 merge_#t~ite15 := merge_#t~ite14; 17802#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 17800#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 17797#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 17795#L11-4 assume true; 17746#L11-1 assume !!(merge_~k~0 < merge_~n); 17745#L12 [2018-11-10 08:44:24,003 INFO L795 eck$LassoCheckResult]: Loop: 17745#L12 assume !(merge_~j~0 == merge_~n); 17750#L13 assume !(merge_~i~0 == merge_~m); 17743#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 17742#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 17740#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 17741#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 17805#L14-4 merge_#t~ite13 := merge_#t~mem10; 17803#L14-6 merge_#t~ite14 := merge_#t~ite13; 17801#L13-4 merge_#t~ite15 := merge_#t~ite14; 17799#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 17798#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 17796#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 17794#L11-4 assume true; 17744#L11-1 assume !!(merge_~k~0 < merge_~n); 17745#L12 [2018-11-10 08:44:24,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1886764864, now seen corresponding path program 1 times [2018-11-10 08:44:24,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:24,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:24,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:24,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:24,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 08:44:24,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:24,126 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:24,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:24,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 44 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 08:44:24,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:44:24,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 19 [2018-11-10 08:44:24,325 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:44:24,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:24,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1735057319, now seen corresponding path program 2 times [2018-11-10 08:44:24,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:24,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:24,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:24,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:24,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:24,460 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-10 08:44:24,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 08:44:24,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-11-10 08:44:24,484 INFO L87 Difference]: Start difference. First operand 466 states and 518 transitions. cyclomatic complexity: 64 Second operand 19 states. [2018-11-10 08:44:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:25,020 INFO L93 Difference]: Finished difference Result 774 states and 862 transitions. [2018-11-10 08:44:25,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 08:44:25,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 774 states and 862 transitions. [2018-11-10 08:44:25,023 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 251 [2018-11-10 08:44:25,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 774 states to 764 states and 852 transitions. [2018-11-10 08:44:25,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 717 [2018-11-10 08:44:25,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 717 [2018-11-10 08:44:25,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 764 states and 852 transitions. [2018-11-10 08:44:25,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:25,027 INFO L705 BuchiCegarLoop]: Abstraction has 764 states and 852 transitions. [2018-11-10 08:44:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states and 852 transitions. [2018-11-10 08:44:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 601. [2018-11-10 08:44:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-10 08:44:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 669 transitions. [2018-11-10 08:44:25,035 INFO L728 BuchiCegarLoop]: Abstraction has 601 states and 669 transitions. [2018-11-10 08:44:25,035 INFO L608 BuchiCegarLoop]: Abstraction has 601 states and 669 transitions. [2018-11-10 08:44:25,035 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 08:44:25,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 601 states and 669 transitions. [2018-11-10 08:44:25,037 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 154 [2018-11-10 08:44:25,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:25,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:25,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:25,039 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:25,039 INFO L793 eck$LassoCheckResult]: Stem: 18986#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 18950#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 18951#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 18969#L40-4 assume true; 18970#L40-1 assume !!(main_~i~1 < main_~n~0); 18982#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 18983#L41-1 havoc main_#t~nondet21; 18926#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 18927#L40-4 assume true; 18940#L40-1 assume !!(main_~i~1 < main_~n~0); 18941#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 18979#L41-1 havoc main_#t~nondet21; 18980#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 19016#L40-4 assume true; 19015#L40-1 assume !!(main_~i~1 < main_~n~0); 19014#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 19012#L41-1 havoc main_#t~nondet21; 19010#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 19008#L40-4 assume true; 19005#L40-1 assume !(main_~i~1 < main_~n~0); 18919#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 18964#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 19017#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 18999#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 19000#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 18998#L24 assume ~n < 2; 19137#merge_sortFINAL assume true; 19134#merge_sortEXIT >#106#return; 18934#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 19022#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 19123#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 19121#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 19122#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 19125#L24 assume ~n < 2; 19124#merge_sortFINAL assume true; 19120#merge_sortEXIT >#106#return; 18994#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 18993#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 18995#L24 assume ~n < 2; 19222#merge_sortFINAL assume true; 19217#merge_sortEXIT >#108#return; 19215#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 19213#L11-4 assume true; 19208#L11-1 assume !!(merge_~k~0 < merge_~n); 19207#L12 assume !(merge_~j~0 == merge_~n); 19206#L13 assume !(merge_~i~0 == merge_~m); 19204#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 19202#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 19199#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 19200#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 19236#L14-4 merge_#t~ite13 := merge_#t~mem10; 19234#L14-6 merge_#t~ite14 := merge_#t~ite13; 19233#L13-4 merge_#t~ite15 := merge_#t~ite14; 19232#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 19231#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 19227#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 19224#L11-4 assume true; 19220#L11-1 assume !!(merge_~k~0 < merge_~n); 19210#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := merge_#t~post3 + 1; 19168#L12-1 SUMMARY for call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post3 * 4, 4); srcloc: L12-1 19152#L12-2 merge_#t~ite15 := merge_#t~mem4; 19148#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 19145#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 19143#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 19141#L11-4 assume true; 19139#L11-1 assume !(merge_~k~0 < merge_~n); 19136#L11-5 merge_~i~0 := 0; 19133#L17-4 assume true; 18936#L17-1 assume !!(merge_~i~0 < merge_~n); 18988#L18 SUMMARY for call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + merge_~i~0 * 4, 4); srcloc: L18 18989#L18-1 SUMMARY for call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L18-1 19002#L18-2 havoc merge_#t~mem17; 19003#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := merge_#t~post16 + 1;havoc merge_#t~post16; 18933#L17-4 assume true; 18935#L17-1 assume !(merge_~i~0 < merge_~n); 18944#L17-5 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := merge_~x~0.base, merge_~x~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 18945#L8 assume { :end_inline_merge } true; 18952#merge_sortFINAL assume true; 18953#merge_sortEXIT >#108#return; 18962#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 18963#L11-4 assume true; 19495#L11-1 assume !!(merge_~k~0 < merge_~n); 18977#L12 assume !(merge_~j~0 == merge_~n); 18978#L13 assume !(merge_~i~0 == merge_~m); 19494#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 19492#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 19489#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 19490#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 19503#L14-4 merge_#t~ite13 := merge_#t~mem10; 19502#L14-6 merge_#t~ite14 := merge_#t~ite13; 19501#L13-4 merge_#t~ite15 := merge_#t~ite14; 19500#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 19499#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 19498#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 19496#L11-4 assume true; 19497#L11-1 assume !!(merge_~k~0 < merge_~n); 19504#L12 [2018-11-10 08:44:25,039 INFO L795 eck$LassoCheckResult]: Loop: 19504#L12 assume !(merge_~j~0 == merge_~n); 18937#L13 assume !(merge_~i~0 == merge_~m); 18938#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 18971#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 18972#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 18973#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 18974#L14-4 merge_#t~ite13 := merge_#t~mem10; 18956#L14-6 merge_#t~ite14 := merge_#t~ite13; 18957#L13-4 merge_#t~ite15 := merge_#t~ite14; 18961#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 18954#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 18955#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 18990#L11-4 assume true; 18991#L11-1 assume !!(merge_~k~0 < merge_~n); 19504#L12 [2018-11-10 08:44:25,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash -43375240, now seen corresponding path program 1 times [2018-11-10 08:44:25,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:25,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:25,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:25,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:25,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 08:44:25,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:44:25,127 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632face9-2d2b-42ed-82cf-c23537aa3fc1/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:44:25,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:25,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:44:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 08:44:25,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:44:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-11-10 08:44:25,287 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:44:25,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1735057319, now seen corresponding path program 3 times [2018-11-10 08:44:25,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:25,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:25,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:44:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 08:44:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-11-10 08:44:25,401 INFO L87 Difference]: Start difference. First operand 601 states and 669 transitions. cyclomatic complexity: 85 Second operand 20 states. [2018-11-10 08:44:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:44:26,092 INFO L93 Difference]: Finished difference Result 1109 states and 1251 transitions. [2018-11-10 08:44:26,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 08:44:26,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1109 states and 1251 transitions. [2018-11-10 08:44:26,097 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 371 [2018-11-10 08:44:26,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1109 states to 1107 states and 1249 transitions. [2018-11-10 08:44:26,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1048 [2018-11-10 08:44:26,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1048 [2018-11-10 08:44:26,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1107 states and 1249 transitions. [2018-11-10 08:44:26,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:44:26,105 INFO L705 BuchiCegarLoop]: Abstraction has 1107 states and 1249 transitions. [2018-11-10 08:44:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states and 1249 transitions. [2018-11-10 08:44:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 631. [2018-11-10 08:44:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-11-10 08:44:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 699 transitions. [2018-11-10 08:44:26,116 INFO L728 BuchiCegarLoop]: Abstraction has 631 states and 699 transitions. [2018-11-10 08:44:26,116 INFO L608 BuchiCegarLoop]: Abstraction has 631 states and 699 transitions. [2018-11-10 08:44:26,116 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 08:44:26,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 631 states and 699 transitions. [2018-11-10 08:44:26,118 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 154 [2018-11-10 08:44:26,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:44:26,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:44:26,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:26,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:44:26,119 INFO L793 eck$LassoCheckResult]: Stem: 21055#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 21019#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 21020#L35 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 21035#L40-4 assume true; 21036#L40-1 assume !!(main_~i~1 < main_~n~0); 21050#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 21051#L41-1 havoc main_#t~nondet21; 20997#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 20998#L40-4 assume true; 21008#L40-1 assume !!(main_~i~1 < main_~n~0); 21009#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 21047#L41-1 havoc main_#t~nondet21; 21048#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 21083#L40-4 assume true; 21082#L40-1 assume !!(main_~i~1 < main_~n~0); 21080#L41 SUMMARY for call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + main_~i~1 * 4, 4); srcloc: L41 21078#L41-1 havoc main_#t~nondet21; 21076#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := main_#t~post20 + 1;havoc main_#t~post20; 21070#L40-4 assume true; 21071#L40-1 assume !(main_~i~1 < main_~n~0); 20990#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 21030#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 21226#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 21064#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 21065#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 21063#L24 assume ~n < 2; 21277#merge_sortFINAL assume true; 21273#merge_sortEXIT >#106#return; 21053#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 21086#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 21084#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && ~n % 2 != 0 then ~n / 2 + 1 else ~n / 2); 21085#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 21224#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 21231#L24 assume ~n < 2; 21229#merge_sortFINAL assume true; 21223#merge_sortEXIT >#106#return; 21214#L27-1 call merge_sort(~a.base, ~a.offset + ~m~0 * 4, ~n - ~m~0);< 21215#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 21225#L24 assume ~n < 2; 21216#merge_sortFINAL assume true; 21213#merge_sortEXIT >#108#return; 21212#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 21211#L11-4 assume true; 21210#L11-1 assume !!(merge_~k~0 < merge_~n); 21209#L12 assume !(merge_~j~0 == merge_~n); 21208#L13 assume !(merge_~i~0 == merge_~m); 21207#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 21206#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 21204#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 21205#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 21363#L14-4 merge_#t~ite13 := merge_#t~mem10; 21362#L14-6 merge_#t~ite14 := merge_#t~ite13; 21361#L13-4 merge_#t~ite15 := merge_#t~ite14; 21360#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 21359#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 21358#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 21356#L11-4 assume true; 21354#L11-1 assume !!(merge_~k~0 < merge_~n); 21352#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := merge_#t~post3 + 1; 21350#L12-1 SUMMARY for call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post3 * 4, 4); srcloc: L12-1 21184#L12-2 merge_#t~ite15 := merge_#t~mem4; 21182#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 21180#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 21178#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 21168#L11-4 assume true; 21165#L11-1 assume !(merge_~k~0 < merge_~n); 21162#L11-5 merge_~i~0 := 0; 21160#L17-4 assume true; 21158#L17-1 assume !!(merge_~i~0 < merge_~n); 21156#L18 SUMMARY for call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + merge_~i~0 * 4, 4); srcloc: L18 21154#L18-1 SUMMARY for call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L18-1 21152#L18-2 havoc merge_#t~mem17; 21148#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := merge_#t~post16 + 1;havoc merge_#t~post16; 21147#L17-4 assume true; 21124#L17-1 assume !!(merge_~i~0 < merge_~n); 21132#L18 SUMMARY for call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + merge_~i~0 * 4, 4); srcloc: L18 21130#L18-1 SUMMARY for call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L18-1 21128#L18-2 havoc merge_#t~mem17; 21126#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := merge_#t~post16 + 1;havoc merge_#t~post16; 21123#L17-4 assume true; 21116#L17-1 assume !(merge_~i~0 < merge_~n); 21117#L17-5 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := merge_~x~0.base, merge_~x~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 21411#L8 assume { :end_inline_merge } true; 21410#merge_sortFINAL assume true; 21052#merge_sortEXIT >#108#return; 21028#L28 assume { :begin_inline_merge } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := merge_~n * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 21029#L11-4 assume true; 21552#L11-1 assume !!(merge_~k~0 < merge_~n); 21551#L12 assume !(merge_~j~0 == merge_~n); 21550#L13 assume !(merge_~i~0 == merge_~m); 21549#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 21548#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 21547#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 21545#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 21542#L14-4 merge_#t~ite13 := merge_#t~mem10; 21540#L14-6 merge_#t~ite14 := merge_#t~ite13; 21541#L13-4 merge_#t~ite15 := merge_#t~ite14; 21536#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 21537#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 21532#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 21533#L11-4 assume true; 21017#L11-1 assume !!(merge_~k~0 < merge_~n); 21018#L12 [2018-11-10 08:44:26,120 INFO L795 eck$LassoCheckResult]: Loop: 21018#L12 assume !(merge_~j~0 == merge_~n); 21005#L13 assume !(merge_~i~0 == merge_~m); 21006#L14 SUMMARY for call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + merge_~j~0 * 4, 4); srcloc: L14 21039#L14-1 SUMMARY for call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + merge_~i~0 * 4, 4); srcloc: L14-1 21040#L14-2 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := merge_#t~post9 + 1; 21043#L14-3 SUMMARY for call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + merge_#t~post9 * 4, 4); srcloc: L14-3 21044#L14-4 merge_#t~ite13 := merge_#t~mem10; 21026#L14-6 merge_#t~ite14 := merge_#t~ite13; 21027#L13-4 merge_#t~ite15 := merge_#t~ite14; 21025#L12-4 SUMMARY for call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + merge_~k~0 * 4, 4); srcloc: L12-4 21023#L12-5 havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~post11;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~post5;havoc merge_#t~mem7;havoc merge_#t~ite13; 21024#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := merge_#t~post2 + 1;havoc merge_#t~post2; 21058#L11-4 assume true; 21059#L11-1 assume !!(merge_~k~0 < merge_~n); 21018#L12 [2018-11-10 08:44:26,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1514774576, now seen corresponding path program 2 times [2018-11-10 08:44:26,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:26,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:26,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:26,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:26,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:26,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:26,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1735057319, now seen corresponding path program 4 times [2018-11-10 08:44:26,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:26,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:26,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:26,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:44:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1624195656, now seen corresponding path program 3 times [2018-11-10 08:44:26,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:44:26,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:44:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:26,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:44:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:44:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:44:26,358 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-10 08:44:27,507 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 285 DAG size of output: 243 [2018-11-10 08:44:28,100 WARN L179 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 119 [2018-11-10 08:44:28,298 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-11-10 08:44:28,444 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-10 08:44:30,005 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 291 DAG size of output: 263 [2018-11-10 08:44:31,035 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 147 DAG size of output: 137 [2018-11-10 08:44:31,182 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2018-11-10 08:44:31,579 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-11-10 08:44:31,976 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-10 08:44:33,673 WARN L179 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 201 DAG size of output: 195 [2018-11-10 08:44:34,214 WARN L179 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-11-10 08:44:34,216 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:44:34,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:44:34,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:44:34,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:44:34,217 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:44:34,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:44:34,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:44:34,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:44:34,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration18_Lasso [2018-11-10 08:44:34,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:44:34,217 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:44:34,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:44:34,575 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 08:44:34,577 INFO L168 Benchmark]: Toolchain (without parser) took 30108.34 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 960.3 MB in the beginning and 1.3 GB in the end (delta: -358.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 08:44:34,577 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:44:34,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.51 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:44:34,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.68 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:44:34,578 INFO L168 Benchmark]: Boogie Preprocessor took 23.84 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:44:34,579 INFO L168 Benchmark]: RCFGBuilder took 387.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:44:34,579 INFO L168 Benchmark]: BuchiAutomizer took 29497.91 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 918.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 08:44:34,582 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.51 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.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 30.68 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.84 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 387.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29497.91 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 918.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.9 MB). Peak memory consumption was 1.1 GB. 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 * 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...