./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e43c76eef4a87266f6a401a44aa5422f52ed742 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:11:24,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:11:24,765 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:11:24,772 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:11:24,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:11:24,773 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:11:24,773 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:11:24,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:11:24,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:11:24,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:11:24,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:11:24,777 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:11:24,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:11:24,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:11:24,779 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:11:24,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:11:24,780 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:11:24,781 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:11:24,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:11:24,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:11:24,784 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:11:24,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:11:24,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:11:24,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:11:24,787 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:11:24,788 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:11:24,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:11:24,789 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:11:24,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:11:24,790 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:11:24,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:11:24,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:11:24,791 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:11:24,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:11:24,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:11:24,792 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:11:24,793 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 03:11:24,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:11:24,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:11:24,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:11:24,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:11:24,804 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:11:24,804 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:11:24,804 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:11:24,804 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:11:24,804 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:11:24,805 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:11:24,805 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:11:24,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:11:24,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:11:24,805 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:11:24,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:11:24,805 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:11:24,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:11:24,806 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:11:24,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:11:24,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:11:24,806 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:11:24,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:11:24,806 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:11:24,806 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:11:24,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:11:24,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:11:24,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:11:24,807 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:11:24,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:11:24,807 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:11:24,807 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:11:24,808 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:11:24,808 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_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e43c76eef4a87266f6a401a44aa5422f52ed742 [2018-11-23 03:11:24,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:11:24,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:11:24,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:11:24,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:11:24,843 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:11:24,843 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-11-23 03:11:24,879 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/data/42ba51ffb/4794a99d0fa943a7a83d8855eb7dd086/FLAG8bd916b2d [2018-11-23 03:11:25,338 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:11:25,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-11-23 03:11:25,349 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/data/42ba51ffb/4794a99d0fa943a7a83d8855eb7dd086/FLAG8bd916b2d [2018-11-23 03:11:25,361 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/data/42ba51ffb/4794a99d0fa943a7a83d8855eb7dd086 [2018-11-23 03:11:25,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:11:25,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:11:25,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:11:25,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:11:25,368 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:11:25,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174bb65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25, skipping insertion in model container [2018-11-23 03:11:25,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:11:25,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:11:25,738 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:11:25,749 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:11:25,799 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:11:25,837 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:11:25,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25 WrapperNode [2018-11-23 03:11:25,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:11:25,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:11:25,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:11:25,838 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:11:25,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:11:25,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:11:25,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:11:25,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:11:25,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... [2018-11-23 03:11:25,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:11:25,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:11:25,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:11:25,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:11:25,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:11:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:11:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 03:11:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 03:11:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:11:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 03:11:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:11:25,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:11:26,143 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:11:26,143 INFO L280 CfgBuilder]: Removed 20 assue(true) statements. [2018-11-23 03:11:26,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:26 BoogieIcfgContainer [2018-11-23 03:11:26,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:11:26,144 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:11:26,144 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:11:26,146 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:11:26,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:11:26,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:11:25" (1/3) ... [2018-11-23 03:11:26,148 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69d84e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:11:26, skipping insertion in model container [2018-11-23 03:11:26,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:11:26,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:25" (2/3) ... [2018-11-23 03:11:26,148 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69d84e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:11:26, skipping insertion in model container [2018-11-23 03:11:26,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:11:26,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:26" (3/3) ... [2018-11-23 03:11:26,149 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-11-23 03:11:26,181 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:11:26,182 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:11:26,182 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:11:26,182 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:11:26,182 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:11:26,182 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:11:26,182 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:11:26,183 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:11:26,183 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:11:26,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-23 03:11:26,211 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 03:11:26,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:26,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:26,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:26,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:26,217 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:11:26,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-23 03:11:26,218 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 03:11:26,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:26,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:26,218 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:26,218 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:26,221 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 6#L-1true havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 16#L1065true assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 15#L1066true entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 8#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 18#L1076true entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 7#L1470true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 27#L1471-3true [2018-11-23 03:11:26,222 INFO L796 eck$LassoCheckResult]: Loop: 27#L1471-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 21#L1471-2true entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 27#L1471-3true [2018-11-23 03:11:26,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815372, now seen corresponding path program 1 times [2018-11-23 03:11:26,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:26,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:26,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:26,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:26,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:11:26,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:11:26,354 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:26,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:26,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2018-11-23 03:11:26,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:26,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:26,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:26,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:11:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:11:26,464 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2018-11-23 03:11:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:26,509 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 03:11:26,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:11:26,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2018-11-23 03:11:26,512 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2018-11-23 03:11:26,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 44 transitions. [2018-11-23 03:11:26,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-23 03:11:26,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-23 03:11:26,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-11-23 03:11:26,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:11:26,516 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-23 03:11:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-11-23 03:11:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-11-23 03:11:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 03:11:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-23 03:11:26,534 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-23 03:11:26,534 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-23 03:11:26,534 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:11:26,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-23 03:11:26,534 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 03:11:26,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:26,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:26,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:26,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:26,535 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 94#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 95#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 90#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 91#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 96#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 97#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 101#L1471-3 [2018-11-23 03:11:26,535 INFO L796 eck$LassoCheckResult]: Loop: 101#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 102#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 101#L1471-3 [2018-11-23 03:11:26,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:26,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1806813450, now seen corresponding path program 1 times [2018-11-23 03:11:26,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:26,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:26,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:26,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2018-11-23 03:11:26,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:26,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:26,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:26,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:26,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:26,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938732, now seen corresponding path program 1 times [2018-11-23 03:11:26,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:26,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:26,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:26,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:26,865 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-23 03:11:26,937 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:11:26,937 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:11:26,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:11:26,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:11:26,938 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:11:26,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:11:26,938 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:11:26,938 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:11:26,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-23 03:11:26,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:11:26,939 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:11:26,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:26,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:27,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:27,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:27,404 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:11:27,408 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:11:27,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:27,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:27,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:27,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:27,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:27,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:27,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:27,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:27,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:27,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,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-23 03:11:27,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,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-23 03:11:27,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:27,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:27,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:27,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,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-23 03:11:27,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,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-23 03:11:27,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,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-23 03:11:27,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:27,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:27,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:27,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,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-23 03:11:27,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,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-23 03:11:27,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,485 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:27,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,487 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:27,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:27,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:27,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:27,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:27,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:27,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:27,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:27,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:27,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:27,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:27,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:27,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:27,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:27,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:27,560 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:11:27,583 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 03:11:27,583 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 03:11:27,585 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:11:27,586 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:11:27,586 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:11:27,587 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~2) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2018-11-23 03:11:27,625 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 03:11:27,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:27,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:27,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:27,686 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:11:27,687 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 03:11:27,716 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 6 states. [2018-11-23 03:11:27,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 03:11:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:11:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-23 03:11:27,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 03:11:27,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:27,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 03:11:27,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:27,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 03:11:27,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:27,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2018-11-23 03:11:27,722 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 03:11:27,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 24 states and 31 transitions. [2018-11-23 03:11:27,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-23 03:11:27,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 03:11:27,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-11-23 03:11:27,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:11:27,723 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-23 03:11:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-11-23 03:11:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 03:11:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:11:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-11-23 03:11:27,725 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-23 03:11:27,725 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-23 03:11:27,725 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:11:27,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2018-11-23 03:11:27,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 03:11:27,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:27,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:27,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:27,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 03:11:27,727 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 234#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 235#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 230#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 231#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 236#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 237#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 241#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 247#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 226#L1444-3 [2018-11-23 03:11:27,727 INFO L796 eck$LassoCheckResult]: Loop: 226#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 228#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 238#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 239#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 225#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 226#L1444-3 [2018-11-23 03:11:27,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938674, now seen corresponding path program 1 times [2018-11-23 03:11:27,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:27,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:27,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:27,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:27,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:27,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:11:27,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:11:27,778 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:27,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:27,778 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 1 times [2018-11-23 03:11:27,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:27,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:27,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:27,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:27,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:27,906 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 03:11:27,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:11:27,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:11:27,953 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-23 03:11:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:27,983 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2018-11-23 03:11:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:11:27,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-11-23 03:11:27,985 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2018-11-23 03:11:27,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2018-11-23 03:11:27,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-23 03:11:27,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-23 03:11:27,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2018-11-23 03:11:27,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:11:27,986 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-23 03:11:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2018-11-23 03:11:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2018-11-23 03:11:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 03:11:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-23 03:11:27,988 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 03:11:27,989 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 03:11:27,989 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:11:27,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-11-23 03:11:27,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 03:11:27,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:27,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:27,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:27,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 03:11:27,993 INFO L794 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 314#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 315#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 312#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 313#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 330#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 334#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 333#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 331#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 308#L1444-3 [2018-11-23 03:11:27,993 INFO L796 eck$LassoCheckResult]: Loop: 308#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 310#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 321#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 322#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 307#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 308#L1444-3 [2018-11-23 03:11:27,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash -594068688, now seen corresponding path program 1 times [2018-11-23 03:11:27,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:27,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:28,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:11:28,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:11:28,029 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:28,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:28,029 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 2 times [2018-11-23 03:11:28,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:28,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:28,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:28,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:11:28,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:11:28,170 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-23 03:11:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:28,194 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-23 03:11:28,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:11:28,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2018-11-23 03:11:28,197 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 03:11:28,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 36 transitions. [2018-11-23 03:11:28,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 03:11:28,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 03:11:28,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2018-11-23 03:11:28,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:11:28,198 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-23 03:11:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2018-11-23 03:11:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 03:11:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:11:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-23 03:11:28,199 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-23 03:11:28,199 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-23 03:11:28,199 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:11:28,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-23 03:11:28,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 03:11:28,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:28,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:28,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:28,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 03:11:28,203 INFO L794 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 385#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 386#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 383#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 384#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 389#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 390#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 394#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 395#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 396#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 400#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 379#L1444-3 [2018-11-23 03:11:28,203 INFO L796 eck$LassoCheckResult]: Loop: 379#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 381#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 391#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 392#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 378#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 379#L1444-3 [2018-11-23 03:11:28,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1010756116, now seen corresponding path program 1 times [2018-11-23 03:11:28,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:28,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:28,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:28,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:28,220 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 3 times [2018-11-23 03:11:28,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:28,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:28,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:28,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash 754630971, now seen corresponding path program 1 times [2018-11-23 03:11:28,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:28,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:28,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:28,571 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 117 [2018-11-23 03:11:28,656 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:11:28,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:11:28,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:11:28,657 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:11:28,657 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:11:28,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:11:28,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:11:28,657 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:11:28,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-23 03:11:28,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:11:28,657 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:11:28,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-23 03:11:28,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,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-23 03:11:28,842 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-11-23 03:11:28,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,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-23 03:11:28,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-23 03:11:28,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-23 03:11:28,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-23 03:11:28,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-23 03:11:28,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-23 03:11:28,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:28,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-23 03:11:28,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-23 03:11:28,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-23 03:11:29,300 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:11:29,301 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:11:29,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:29,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:29,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:29,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:29,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:29,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:29,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:29,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:29,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:29,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:29,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:29,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:29,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,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-23 03:11:29,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,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-23 03:11:29,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:29,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:29,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:29,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,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-23 03:11:29,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,350 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:29,350 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:11:29,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,354 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 03:11:29,355 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 03:11:29,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,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-23 03:11:29,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,381 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:29,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,382 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:29,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:29,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:29,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:29,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:29,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:29,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:29,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:29,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:29,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:29,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:29,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:29,409 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:11:29,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:11:29,428 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 03:11:29,428 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:11:29,429 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:11:29,430 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:11:29,430 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2018-11-23 03:11:29,470 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 03:11:29,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:29,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:29,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:29,522 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:11:29,522 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 03:11:29,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 43 states and 56 transitions. Complement of second has 6 states. [2018-11-23 03:11:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 03:11:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:11:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-23 03:11:29,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 03:11:29,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:29,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-23 03:11:29,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:29,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-23 03:11:29,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:29,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2018-11-23 03:11:29,548 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 03:11:29,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 31 states and 40 transitions. [2018-11-23 03:11:29,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 03:11:29,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 03:11:29,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-11-23 03:11:29,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:29,549 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-23 03:11:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-11-23 03:11:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 03:11:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 03:11:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-23 03:11:29,550 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 03:11:29,550 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 03:11:29,550 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:11:29,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-23 03:11:29,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 03:11:29,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:29,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:29,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:29,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:29,554 INFO L794 eck$LassoCheckResult]: Stem: 571#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 563#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 564#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 559#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 560#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 565#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 566#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 572#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 573#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 574#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 578#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 554#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 555#L1444-4 alloc_17_#res := 0; 558#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 577#L1460-3 [2018-11-23 03:11:29,554 INFO L796 eck$LassoCheckResult]: Loop: 577#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 576#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 577#L1460-3 [2018-11-23 03:11:29,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:29,554 INFO L82 PathProgramCache]: Analyzing trace with hash -580221115, now seen corresponding path program 1 times [2018-11-23 03:11:29,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:29,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:11:29,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:11:29,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:11:29,602 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:29,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:29,602 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2018-11-23 03:11:29,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:29,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:29,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:29,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:11:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:11:29,636 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 03:11:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:29,697 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-11-23 03:11:29,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:11:29,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 86 transitions. [2018-11-23 03:11:29,699 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2018-11-23 03:11:29,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 86 transitions. [2018-11-23 03:11:29,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-23 03:11:29,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-23 03:11:29,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 86 transitions. [2018-11-23 03:11:29,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:29,700 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 86 transitions. [2018-11-23 03:11:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 86 transitions. [2018-11-23 03:11:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2018-11-23 03:11:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 03:11:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-23 03:11:29,703 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-23 03:11:29,703 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-23 03:11:29,703 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 03:11:29,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2018-11-23 03:11:29,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 03:11:29,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:29,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:29,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:29,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:29,704 INFO L794 eck$LassoCheckResult]: Stem: 679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 670#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 671#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 666#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 667#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 673#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 674#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 689#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 682#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 683#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 690#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 691#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 664#L1444-4 alloc_17_#res := 0; 665#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 686#L1460-3 [2018-11-23 03:11:29,704 INFO L796 eck$LassoCheckResult]: Loop: 686#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 685#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 686#L1460-3 [2018-11-23 03:11:29,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash -838386553, now seen corresponding path program 1 times [2018-11-23 03:11:29,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:29,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:29,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:29,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:11:29,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:11:29,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:11:29,746 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:29,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2018-11-23 03:11:29,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:29,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:29,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:29,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:29,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:11:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:11:29,769 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-23 03:11:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:29,802 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 03:11:29,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:11:29,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2018-11-23 03:11:29,804 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:11:29,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 64 transitions. [2018-11-23 03:11:29,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 03:11:29,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 03:11:29,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2018-11-23 03:11:29,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:29,805 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 64 transitions. [2018-11-23 03:11:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2018-11-23 03:11:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-11-23 03:11:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 03:11:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-23 03:11:29,807 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 03:11:29,807 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 03:11:29,807 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 03:11:29,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-23 03:11:29,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 03:11:29,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:29,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:29,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:29,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:29,809 INFO L794 eck$LassoCheckResult]: Stem: 778#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 768#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 769#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 766#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 767#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 772#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 773#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 779#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 780#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 781#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 785#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 761#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 763#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 774#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 775#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 786#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 771#L1451-3 [2018-11-23 03:11:29,810 INFO L796 eck$LassoCheckResult]: Loop: 771#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 770#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 771#L1451-3 [2018-11-23 03:11:29,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash 754690497, now seen corresponding path program 1 times [2018-11-23 03:11:29,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:29,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:29,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2018-11-23 03:11:29,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:29,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:29,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash -591903197, now seen corresponding path program 1 times [2018-11-23 03:11:29,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:29,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:29,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:29,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:11:29,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:11:29,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:11:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:11:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:11:29,942 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 03:11:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:30,029 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-11-23 03:11:30,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 03:11:30,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 87 transitions. [2018-11-23 03:11:30,030 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2018-11-23 03:11:30,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 87 transitions. [2018-11-23 03:11:30,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-23 03:11:30,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-23 03:11:30,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2018-11-23 03:11:30,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:30,031 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-11-23 03:11:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2018-11-23 03:11:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2018-11-23 03:11:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 03:11:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-11-23 03:11:30,034 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-23 03:11:30,034 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-23 03:11:30,034 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 03:11:30,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2018-11-23 03:11:30,034 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 03:11:30,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:30,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:30,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:30,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:30,035 INFO L794 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 891#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 892#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 893#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 911#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 912#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 903#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 904#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 916#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 914#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 915#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 882#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 883#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 900#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 901#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 880#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 881#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 886#L1444-4 alloc_17_#res := 0; 888#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 910#L1460-3 [2018-11-23 03:11:30,035 INFO L796 eck$LassoCheckResult]: Loop: 910#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 909#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 910#L1460-3 [2018-11-23 03:11:30,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:30,035 INFO L82 PathProgramCache]: Analyzing trace with hash 420857150, now seen corresponding path program 1 times [2018-11-23 03:11:30,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:30,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:30,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:30,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:11:30,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:11:30,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:11:30,058 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:30,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:30,058 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 3 times [2018-11-23 03:11:30,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:30,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:30,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:30,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:30,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:11:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:11:30,087 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-23 03:11:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:30,107 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2018-11-23 03:11:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:11:30,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2018-11-23 03:11:30,109 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-23 03:11:30,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 63 states and 76 transitions. [2018-11-23 03:11:30,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-23 03:11:30,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-23 03:11:30,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 76 transitions. [2018-11-23 03:11:30,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:30,110 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 76 transitions. [2018-11-23 03:11:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 76 transitions. [2018-11-23 03:11:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2018-11-23 03:11:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 03:11:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-11-23 03:11:30,115 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-11-23 03:11:30,115 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-11-23 03:11:30,115 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 03:11:30,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2018-11-23 03:11:30,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 03:11:30,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:30,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:30,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:30,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:30,116 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1013#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1014#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1011#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1012#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1018#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1019#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1049#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1037#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1035#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1036#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1005#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1006#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1048#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1047#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1046#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1045#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1008#L1444-4 alloc_17_#res := 0; 1010#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1032#L1460-3 [2018-11-23 03:11:30,116 INFO L796 eck$LassoCheckResult]: Loop: 1032#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1031#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1032#L1460-3 [2018-11-23 03:11:30,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1354150212, now seen corresponding path program 1 times [2018-11-23 03:11:30,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:30,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:30,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:30,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:30,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 4 times [2018-11-23 03:11:30,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:30,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:30,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:30,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash 36739678, now seen corresponding path program 1 times [2018-11-23 03:11:30,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:30,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:30,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:30,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:30,898 WARN L180 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 182 [2018-11-23 03:11:30,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 03:11:30,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 03:11:31,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 03:11:31,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:325, output treesize:326 [2018-11-23 03:11:31,353 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-11-23 03:11:31,356 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:11:31,356 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:11:31,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:11:31,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:11:31,356 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:11:31,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:11:31,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:11:31,356 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:11:31,357 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration10_Lasso [2018-11-23 03:11:31,357 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:11:31,357 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:11:31,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-23 03:11:31,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,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-23 03:11:31,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-23 03:11:31,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-23 03:11:31,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-23 03:11:31,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-23 03:11:31,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-23 03:11:31,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-23 03:11:31,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-23 03:11:31,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,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-23 03:11:31,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-23 03:11:31,768 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2018-11-23 03:11:31,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:31,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:32,203 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:11:32,204 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:11:32,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,253 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:32,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,255 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:32,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,274 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:32,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,275 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:32,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,286 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:32,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,286 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:32,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:32,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:32,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:32,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:32,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:32,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:32,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:32,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:32,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:32,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:32,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:32,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:11:32,354 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 03:11:32,354 INFO L444 ModelExtractionUtils]: 51 out of 61 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 03:11:32,355 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:11:32,355 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:11:32,355 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:11:32,355 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, v_rep(select #length ULTIMATE.start_free_17_~array.base)_1, ULTIMATE.start_free_17_~array.offset) = -4*ULTIMATE.start_free_17_~i~1 + 2*v_rep(select #length ULTIMATE.start_free_17_~array.base)_1 - 1*ULTIMATE.start_free_17_~array.offset Supporting invariants [] [2018-11-23 03:11:32,421 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-23 03:11:32,422 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:11:32,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:32,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:32,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:32,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:11:32,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-11-23 03:11:32,472 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 49 states and 62 transitions. Complement of second has 4 states. [2018-11-23 03:11:32,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:11:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:11:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2018-11-23 03:11:32,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-23 03:11:32,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:32,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-23 03:11:32,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:32,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-23 03:11:32,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:32,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 62 transitions. [2018-11-23 03:11:32,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:11:32,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 23 states and 26 transitions. [2018-11-23 03:11:32,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 03:11:32,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 03:11:32,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-23 03:11:32,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:32,476 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 03:11:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-23 03:11:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 03:11:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 03:11:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 03:11:32,477 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 03:11:32,478 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 03:11:32,478 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 03:11:32,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-11-23 03:11:32,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:11:32,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:32,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:32,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:32,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:32,479 INFO L794 eck$LassoCheckResult]: Stem: 1279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1271#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1272#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1267#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1268#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1273#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1274#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1280#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1281#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1282#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1283#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1264#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1265#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1277#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1278#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1262#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1263#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1266#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1275#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1276#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1284#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1270#L1451-3 [2018-11-23 03:11:32,479 INFO L796 eck$LassoCheckResult]: Loop: 1270#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1269#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1270#L1451-3 [2018-11-23 03:11:32,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:32,480 INFO L82 PathProgramCache]: Analyzing trace with hash 38170488, now seen corresponding path program 1 times [2018-11-23 03:11:32,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:32,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:32,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:32,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:32,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:11:32,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82c82271-6e9a-4216-9ef7-fcf9914da9a7/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-23 03:11:32,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:32,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:32,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:11:32,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-11-23 03:11:32,650 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:32,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:32,650 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 2 times [2018-11-23 03:11:32,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:32,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 03:11:32,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 03:11:32,719 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 15 states. [2018-11-23 03:11:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:32,842 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 03:11:32,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 03:11:32,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-11-23 03:11:32,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:11:32,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 29 transitions. [2018-11-23 03:11:32,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 03:11:32,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 03:11:32,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-11-23 03:11:32,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:32,844 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 03:11:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-11-23 03:11:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 03:11:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 03:11:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 03:11:32,846 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 03:11:32,846 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 03:11:32,846 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 03:11:32,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-11-23 03:11:32,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:11:32,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:32,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:32,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:32,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:11:32,847 INFO L794 eck$LassoCheckResult]: Stem: 1428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1420#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1421#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1416#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1417#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1422#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1423#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1429#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1430#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1431#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1432#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1435#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1433#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1413#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1414#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1426#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1427#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1411#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1412#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1415#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1424#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1425#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1434#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1419#L1451-3 [2018-11-23 03:11:32,847 INFO L796 eck$LassoCheckResult]: Loop: 1419#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1418#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1419#L1451-3 [2018-11-23 03:11:32,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:32,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2124874406, now seen corresponding path program 2 times [2018-11-23 03:11:32,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:32,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:32,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:32,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:32,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 3 times [2018-11-23 03:11:32,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:32,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:32,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1894836356, now seen corresponding path program 1 times [2018-11-23 03:11:32,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:32,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:32,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:32,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:34,043 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 239 DAG size of output: 205 [2018-11-23 03:11:34,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 03:11:34,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 03:11:34,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 03:11:34,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 03:11:34,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 03:11:34,386 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:306, output treesize:298 [2018-11-23 03:11:34,541 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-23 03:11:34,543 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:11:34,543 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:11:34,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:11:34,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:11:34,543 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:11:34,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:11:34,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:11:34,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:11:34,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration12_Lasso [2018-11-23 03:11:34,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:11:34,544 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:11:34,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,763 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2018-11-23 03:11:34,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:34,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:35,083 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:11:35,083 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:11:35,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,134 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:35,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,134 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:35,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,139 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:35,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,139 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:35,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,150 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:35,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,151 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:35,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:35,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:35,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:35,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:35,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:35,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:35,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:35,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:35,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:35,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:35,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:35,175 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:11:35,179 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:11:35,179 INFO L444 ModelExtractionUtils]: 40 out of 43 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:11:35,179 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:11:35,180 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:11:35,180 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:11:35,180 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2018-11-23 03:11:35,291 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 03:11:35,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:35,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:35,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:35,342 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:11:35,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 03:11:35,347 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 27 states and 31 transitions. Complement of second has 4 states. [2018-11-23 03:11:35,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:11:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:11:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-23 03:11:35,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-23 03:11:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:35,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 25 letters. Loop has 2 letters. [2018-11-23 03:11:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:35,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-23 03:11:35,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:35,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-11-23 03:11:35,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:11:35,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-11-23 03:11:35,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:11:35,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:11:35,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:11:35,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:11:35,350 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:11:35,350 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:11:35,350 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:11:35,350 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 03:11:35,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:11:35,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:11:35,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:11:35,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:11:35 BoogieIcfgContainer [2018-11-23 03:11:35,354 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:11:35,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:11:35,355 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:11:35,355 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:11:35,355 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:26" (3/4) ... [2018-11-23 03:11:35,358 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:11:35,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:11:35,358 INFO L168 Benchmark]: Toolchain (without parser) took 9994.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 406.8 MB). Free memory was 952.1 MB in the beginning and 957.4 MB in the end (delta: -5.2 MB). Peak memory consumption was 401.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:35,359 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:11:35,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 952.1 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:35,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:35,360 INFO L168 Benchmark]: Boogie Preprocessor took 18.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:35,360 INFO L168 Benchmark]: RCFGBuilder took 250.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:35,361 INFO L168 Benchmark]: BuchiAutomizer took 9210.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.9 MB). Free memory was 1.1 GB in the beginning and 957.4 MB in the end (delta: 158.4 MB). Peak memory consumption was 393.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:35,361 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 1.4 GB. Free memory is still 957.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:11:35,364 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 472.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 952.1 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 250.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9210.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.9 MB). Free memory was 1.1 GB in the beginning and 957.4 MB in the end (delta: 158.4 MB). Peak memory consumption was 393.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.15 ms. Allocated memory is still 1.4 GB. Free memory is still 957.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -4 * i + 2 * unknown-#length-unknown[array] + -1 * array and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 8.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 132 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 380 SDtfs, 524 SDslu, 588 SDs, 0 SdLazy, 311 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital323 mio100 ax109 hnf100 lsp86 ukn59 mio100 lsp52 div100 bol100 ite100 ukn100 eq187 hnf89 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 5 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...