./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3cca4963db77635bc2da65f99e90064d806437e6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:02:38,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:02:38,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:02:38,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:02:38,153 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:02:38,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:02:38,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:02:38,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:02:38,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:02:38,157 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:02:38,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:02:38,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:02:38,159 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:02:38,160 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:02:38,160 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:02:38,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:02:38,161 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:02:38,163 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:02:38,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:02:38,165 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:02:38,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:02:38,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:02:38,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:02:38,169 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:02:38,169 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:02:38,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:02:38,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:02:38,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:02:38,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:02:38,172 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:02:38,172 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:02:38,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:02:38,173 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:02:38,173 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:02:38,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:02:38,174 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:02:38,175 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 07:02:38,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:02:38,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:02:38,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 07:02:38,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 07:02:38,187 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 07:02:38,187 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 07:02:38,187 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 07:02:38,188 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 07:02:38,188 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 07:02:38,188 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 07:02:38,188 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 07:02:38,188 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:02:38,188 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 07:02:38,188 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:02:38,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:02:38,189 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 07:02:38,189 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 07:02:38,189 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 07:02:38,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:02:38,189 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 07:02:38,189 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 07:02:38,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 07:02:38,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:02:38,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:02:38,190 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 07:02:38,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:02:38,190 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 07:02:38,190 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 07:02:38,191 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 07:02:38,191 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_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cca4963db77635bc2da65f99e90064d806437e6 [2018-12-02 07:02:38,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:02:38,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:02:38,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:02:38,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:02:38,225 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:02:38,226 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-12-02 07:02:38,266 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/data/30b99fffc/25988ecb26094b1ea98bc635140f846a/FLAG42595e9cf [2018-12-02 07:02:38,689 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:02:38,689 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-12-02 07:02:38,695 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/data/30b99fffc/25988ecb26094b1ea98bc635140f846a/FLAG42595e9cf [2018-12-02 07:02:38,703 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/data/30b99fffc/25988ecb26094b1ea98bc635140f846a [2018-12-02 07:02:38,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:02:38,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:02:38,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:02:38,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:02:38,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:02:38,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72da7353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38, skipping insertion in model container [2018-12-02 07:02:38,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:02:38,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:02:38,868 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:02:38,908 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:02:38,931 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:02:38,950 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:02:38,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38 WrapperNode [2018-12-02 07:02:38,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:02:38,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:02:38,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:02:38,951 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:02:38,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:02:38,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:02:38,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:02:38,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:02:38,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... [2018-12-02 07:02:38,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:02:38,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:02:38,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:02:38,989 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:02:38,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_507141a9-c03c-4562-8dca-53d08754282b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:02:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:02:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 07:02:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 07:02:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 07:02:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:02:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:02:39,134 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:02:39,135 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 07:02:39,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:02:39 BoogieIcfgContainer [2018-12-02 07:02:39,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:02:39,135 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 07:02:39,135 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 07:02:39,139 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 07:02:39,140 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:02:39,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 07:02:38" (1/3) ... [2018-12-02 07:02:39,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@344b1a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:02:39, skipping insertion in model container [2018-12-02 07:02:39,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:02:39,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:38" (2/3) ... [2018-12-02 07:02:39,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@344b1a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:02:39, skipping insertion in model container [2018-12-02 07:02:39,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:02:39,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:02:39" (3/3) ... [2018-12-02 07:02:39,143 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-12-02 07:02:39,178 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 07:02:39,178 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 07:02:39,178 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 07:02:39,178 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 07:02:39,178 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:02:39,179 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:02:39,179 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 07:02:39,179 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:02:39,179 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 07:02:39,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-02 07:02:39,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 07:02:39,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:39,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:39,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 07:02:39,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 07:02:39,213 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 07:02:39,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-02 07:02:39,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 07:02:39,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:39,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:39,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 07:02:39,215 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 07:02:39,221 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 11#L554-2true [2018-12-02 07:02:39,221 INFO L796 eck$LassoCheckResult]: Loop: 11#L554-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 14#L551-1true assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3#L551-3true main_#t~short9 := main_#t~short7; 5#L551-4true assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6#L551-6true assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 12#L552true assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 11#L554-2true [2018-12-02 07:02:39,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 07:02:39,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:39,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:39,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:39,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:39,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:39,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:39,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-12-02 07:02:39,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:39,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:39,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:39,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:39,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:39,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:39,323 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-12-02 07:02:39,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:39,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:39,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:39,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:39,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:39,481 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-12-02 07:02:39,600 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:02:39,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:02:39,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:02:39,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:02:39,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:02:39,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:02:39,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:02:39,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:02:39,602 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-02 07:02:39,602 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:02:39,602 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:02:39,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,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-12-02 07:02:39,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,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-12-02 07:02:39,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-12-02 07:02:39,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:39,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:40,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:02:40,117 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:02:40,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-12-02 07:02:40,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:40,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:40,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:40,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:40,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:40,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:40,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:40,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:40,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:40,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:40,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:40,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:40,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:40,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:40,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:40,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:40,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:40,157 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:40,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:40,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:40,158 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:40,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:40,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:40,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-12-02 07:02:40,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:40,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:40,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:40,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:40,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:40,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:40,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:40,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:40,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:40,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:40,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:40,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:40,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:40,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:40,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:40,173 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:02:40,176 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:02:40,176 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:02:40,177 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:02:40,177 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 07:02:40,177 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:02:40,178 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-12-02 07:02:40,233 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 07:02:40,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:40,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:40,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:40,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:40,308 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 07:02:40,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-12-02 07:02:40,363 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2018-12-02 07:02:40,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 07:02:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 07:02:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-12-02 07:02:40,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-02 07:02:40,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:40,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-02 07:02:40,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:40,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-02 07:02:40,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:40,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-12-02 07:02:40,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 07:02:40,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 50 transitions. [2018-12-02 07:02:40,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-02 07:02:40,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-02 07:02:40,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2018-12-02 07:02:40,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:02:40,374 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-12-02 07:02:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2018-12-02 07:02:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-12-02 07:02:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 07:02:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-12-02 07:02:40,392 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-12-02 07:02:40,392 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-12-02 07:02:40,392 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 07:02:40,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2018-12-02 07:02:40,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 07:02:40,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:40,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:40,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 07:02:40,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 07:02:40,394 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 226#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2018-12-02 07:02:40,394 INFO L796 eck$LassoCheckResult]: Loop: 246#L551-1 assume !main_#t~short7; 227#L551-3 main_#t~short9 := main_#t~short7; 228#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 232#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 242#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 247#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2018-12-02 07:02:40,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 07:02:40,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:40,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:40,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:40,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:40,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2018-12-02 07:02:40,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:40,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:40,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:40,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:02:40,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:02:40,428 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 07:02:40,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:02:40,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:02:40,430 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-12-02 07:02:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:02:40,448 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-02 07:02:40,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:02:40,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-12-02 07:02:40,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 07:02:40,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2018-12-02 07:02:40,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 07:02:40,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-02 07:02:40,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-12-02 07:02:40,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:02:40,451 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 07:02:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-12-02 07:02:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 07:02:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 07:02:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 07:02:40,453 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 07:02:40,453 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 07:02:40,453 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 07:02:40,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-12-02 07:02:40,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 07:02:40,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:40,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:40,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:02:40,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:02:40,454 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 302#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 303#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 311#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 318#L551-3 main_#t~short9 := main_#t~short7; 317#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 316#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 312#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2018-12-02 07:02:40,455 INFO L796 eck$LassoCheckResult]: Loop: 313#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 307#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 308#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 298#L551-3 main_#t~short9 := main_#t~short7; 299#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 304#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 315#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2018-12-02 07:02:40,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:40,455 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-12-02 07:02:40,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:40,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:40,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1175734219, now seen corresponding path program 1 times [2018-12-02 07:02:40,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:40,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:40,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:40,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:40,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1517982238, now seen corresponding path program 1 times [2018-12-02 07:02:40,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:40,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:40,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:40,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:40,651 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-12-02 07:02:40,842 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2018-12-02 07:02:40,887 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:02:40,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:02:40,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:02:40,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:02:40,888 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:02:40,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:02:40,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:02:40,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:02:40,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 07:02:40,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:02:40,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:02:40,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-12-02 07:02:40,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:40,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:40,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-12-02 07:02:40,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:41,343 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:02:41,343 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:02:41,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:41,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:41,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:41,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:41,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:41,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:41,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:41,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:41,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:41,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:41,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:41,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:41,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:41,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:41,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:41,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:41,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:41,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:41,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-12-02 07:02:41,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:41,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:41,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:41,347 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:02:41,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:41,348 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:02:41,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:41,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:41,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-12-02 07:02:41,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:41,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:41,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:41,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:41,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:41,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:41,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:41,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:41,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:41,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:41,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:41,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:41,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:41,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:41,356 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:02:41,359 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:02:41,359 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 07:02:41,359 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:02:41,360 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:02:41,360 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:02:41,360 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-12-02 07:02:41,407 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 07:02:41,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:41,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:41,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:41,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-02 07:02:41,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:41,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:41,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:02:41,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:41,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:41,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:41,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 07:02:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:41,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:41,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:41,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-12-02 07:02:41,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:41,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:02:41,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:41,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:02:41,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:02:41,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:41,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:41,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:41,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:41,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-12-02 07:02:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:41,569 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-02 07:02:41,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-02 07:02:41,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 48 states and 58 transitions. Complement of second has 12 states. [2018-12-02 07:02:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 07:02:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 07:02:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-12-02 07:02:41,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 7 letters. [2018-12-02 07:02:41,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:41,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 15 letters. Loop has 7 letters. [2018-12-02 07:02:41,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:41,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 14 letters. [2018-12-02 07:02:41,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:41,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2018-12-02 07:02:41,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 07:02:41,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 52 transitions. [2018-12-02 07:02:41,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-02 07:02:41,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-02 07:02:41,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2018-12-02 07:02:41,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:02:41,656 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-12-02 07:02:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2018-12-02 07:02:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-12-02 07:02:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 07:02:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-12-02 07:02:41,658 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-02 07:02:41,658 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-02 07:02:41,658 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 07:02:41,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2018-12-02 07:02:41,659 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 07:02:41,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:41,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:41,659 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:02:41,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 07:02:41,659 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 553#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 554#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 577#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 582#L551-3 main_#t~short9 := main_#t~short7; 581#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 580#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 579#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 578#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 559#L554-2 [2018-12-02 07:02:41,659 INFO L796 eck$LassoCheckResult]: Loop: 559#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 563#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 549#L551-3 main_#t~short9 := main_#t~short7; 550#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 555#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 558#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 559#L554-2 [2018-12-02 07:02:41,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450581, now seen corresponding path program 1 times [2018-12-02 07:02:41,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:41,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:41,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:41,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:41,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:41,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-12-02 07:02:41,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:41,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:41,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:41,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1001977698, now seen corresponding path program 1 times [2018-12-02 07:02:41,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:41,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:41,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:41,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:02:41,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:41,985 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2018-12-02 07:02:42,026 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:02:42,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:02:42,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:02:42,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:02:42,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:02:42,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:02:42,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:02:42,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:02:42,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-02 07:02:42,027 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:02:42,027 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:02:42,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:42,434 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:02:42,434 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:02:42,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:42,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:42,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:42,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:42,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:42,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,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-12-02 07:02:42,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:42,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:42,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:42,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:42,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:42,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:42,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:42,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:42,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,445 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:42,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,446 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:42,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:42,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:42,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:42,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:42,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:42,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:42,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:42,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:42,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:42,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:42,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:42,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:42,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:42,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,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-12-02 07:02:42,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:42,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:42,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:42,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:42,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,467 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:42,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,468 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:42,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:42,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:42,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:42,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:42,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:42,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:42,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:42,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:42,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:42,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:42,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:42,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:42,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:42,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:42,478 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:02:42,480 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:02:42,480 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:02:42,481 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:02:42,482 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:02:42,482 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:02:42,482 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-12-02 07:02:42,540 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 07:02:42,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:42,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:42,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:42,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:42,578 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 07:02:42,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-02 07:02:42,609 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 55 states and 66 transitions. Complement of second has 7 states. [2018-12-02 07:02:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 07:02:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 07:02:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 07:02:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-02 07:02:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-02 07:02:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 12 letters. [2018-12-02 07:02:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:42,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 66 transitions. [2018-12-02 07:02:42,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 07:02:42,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 65 transitions. [2018-12-02 07:02:42,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-02 07:02:42,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-02 07:02:42,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 65 transitions. [2018-12-02 07:02:42,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:02:42,613 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-12-02 07:02:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 65 transitions. [2018-12-02 07:02:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-02 07:02:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 07:02:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-12-02 07:02:42,616 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-12-02 07:02:42,616 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-12-02 07:02:42,616 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 07:02:42,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2018-12-02 07:02:42,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 07:02:42,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:42,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:42,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-02 07:02:42,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 07:02:42,618 INFO L794 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 815#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 816#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 845#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 844#L551-3 main_#t~short9 := main_#t~short7; 843#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 842#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 841#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 840#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 831#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 838#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 837#L551-3 main_#t~short9 := main_#t~short7; 835#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 836#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 848#L552 [2018-12-02 07:02:42,618 INFO L796 eck$LassoCheckResult]: Loop: 848#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 849#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 858#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 855#L551-3 main_#t~short9 := main_#t~short7; 854#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 851#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 848#L552 [2018-12-02 07:02:42,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash 48967168, now seen corresponding path program 2 times [2018-12-02 07:02:42,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:42,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:42,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:42,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:42,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1695896472, now seen corresponding path program 3 times [2018-12-02 07:02:42,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:42,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:42,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:02:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:42,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1971308119, now seen corresponding path program 1 times [2018-12-02 07:02:42,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:42,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:42,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:42,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:02:42,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:43,047 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 108 [2018-12-02 07:02:43,097 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:02:43,097 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:02:43,097 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:02:43,097 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:02:43,097 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:02:43,097 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:02:43,097 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:02:43,097 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:02:43,097 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 07:02:43,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:02:43,098 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:02:43,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:43,579 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:02:43,580 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:02:43,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:43,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:43,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:43,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:43,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:43,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:43,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:43,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:43,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:43,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:43,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:43,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:43,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:43,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:43,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:43,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:43,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:43,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:43,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:43,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:43,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:43,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,595 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:43,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,596 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:43,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:43,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:43,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:43,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:43,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:43,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:43,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:43,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:43,615 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:02:43,617 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:02:43,617 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:02:43,617 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:02:43,618 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:02:43,618 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:02:43,618 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2018-12-02 07:02:43,658 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 07:02:43,658 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:43,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:43,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:43,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:43,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:43,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 07:02:43,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:43,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:02:43,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:43,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:43,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:43,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-12-02 07:02:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:43,712 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 07:02:43,713 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-02 07:02:43,746 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 74 states and 87 transitions. Complement of second has 9 states. [2018-12-02 07:02:43,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 07:02:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:02:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-02 07:02:43,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-02 07:02:43,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:43,747 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:02:43,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:43,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:43,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:43,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:43,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 07:02:43,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:43,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:02:43,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:43,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:43,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:43,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-12-02 07:02:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:43,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 07:02:43,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-02 07:02:43,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 72 states and 83 transitions. Complement of second has 11 states. [2018-12-02 07:02:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 07:02:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:02:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-12-02 07:02:43,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-02 07:02:43,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:43,822 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:02:43,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:43,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:43,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:43,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:43,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 07:02:43,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:43,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:02:43,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:43,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:43,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:43,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-12-02 07:02:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:43,872 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 07:02:43,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-02 07:02:43,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 118 states and 142 transitions. Complement of second has 10 states. [2018-12-02 07:02:43,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 07:02:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:02:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-12-02 07:02:43,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-02 07:02:43,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:43,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2018-12-02 07:02:43,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:43,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 12 letters. [2018-12-02 07:02:43,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:43,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 142 transitions. [2018-12-02 07:02:43,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-12-02 07:02:43,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 90 states and 103 transitions. [2018-12-02 07:02:43,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-12-02 07:02:43,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-12-02 07:02:43,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 103 transitions. [2018-12-02 07:02:43,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:02:43,905 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 103 transitions. [2018-12-02 07:02:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 103 transitions. [2018-12-02 07:02:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-12-02 07:02:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 07:02:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-12-02 07:02:43,909 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-12-02 07:02:43,909 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-12-02 07:02:43,909 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 07:02:43,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2018-12-02 07:02:43,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-12-02 07:02:43,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:43,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:43,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 07:02:43,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-12-02 07:02:43,910 INFO L794 eck$LassoCheckResult]: Stem: 1473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1469#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1470#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1498#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1494#L551-3 main_#t~short9 := main_#t~short7; 1491#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1489#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1486#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1487#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 1474#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1476#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1465#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2018-12-02 07:02:43,910 INFO L796 eck$LassoCheckResult]: Loop: 1466#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1471#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1479#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1480#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 1504#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1526#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1525#L551-3 main_#t~short9 := main_#t~short7; 1524#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1523#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1522#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 1477#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1478#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1531#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2018-12-02 07:02:43,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:43,911 INFO L82 PathProgramCache]: Analyzing trace with hash -285922666, now seen corresponding path program 2 times [2018-12-02 07:02:43,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:43,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:43,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:43,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:43,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1998556810, now seen corresponding path program 1 times [2018-12-02 07:02:43,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:43,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:43,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:43,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:02:43,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:43,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash 691396865, now seen corresponding path program 1 times [2018-12-02 07:02:43,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:43,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:43,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:43,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:44,221 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-12-02 07:02:44,547 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 105 [2018-12-02 07:02:44,635 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:02:44,635 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:02:44,635 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:02:44,635 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:02:44,635 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:02:44,635 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:02:44,635 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:02:44,635 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:02:44,636 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-02 07:02:44,636 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:02:44,636 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:02:44,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:44,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:45,102 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:02:45,102 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:02:45,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:45,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:45,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:45,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:45,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:45,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:45,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,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-12-02 07:02:45,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:45,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,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-12-02 07:02:45,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:45,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:45,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:45,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,108 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:02:45,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,108 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:02:45,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:45,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,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-12-02 07:02:45,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:45,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:45,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:45,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,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-12-02 07:02:45,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:45,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:45,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:45,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:45,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:45,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:45,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:45,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:45,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:45,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:45,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:45,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,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-12-02 07:02:45,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,113 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:45,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,114 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:45,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,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-12-02 07:02:45,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,116 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:45,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,116 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:45,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,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-12-02 07:02:45,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:45,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,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-12-02 07:02:45,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:45,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,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-12-02 07:02:45,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:45,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:45,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:45,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:45,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,133 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:45,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,133 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:45,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:45,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:45,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:45,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:45,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:45,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:45,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:45,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:45,141 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:02:45,145 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 07:02:45,145 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:02:45,145 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:02:45,146 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-12-02 07:02:45,146 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:02:45,146 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem5) = 1*ULTIMATE.start_main_#t~mem5 Supporting invariants [1*ULTIMATE.start_main_#t~mem5 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 >= 0, 2*ULTIMATE.start_main_#t~mem5 - 1 >= 0] [2018-12-02 07:02:45,215 INFO L297 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2018-12-02 07:02:45,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:45,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:45,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 07:02:45,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 07:02:45,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-02 07:02:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:45,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:45,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-12-02 07:02:45,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-12-02 07:02:45,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2018-12-02 07:02:45,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-02 07:02:45,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-02 07:02:45,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:02:45,408 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-02 07:02:45,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:02:45,418 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,423 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-02 07:02:45,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:02:45,452 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,456 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:02:45,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:02:45,499 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2018-12-02 07:02:45,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 07:02:45,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:02:45,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-12-02 07:02:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 07:02:45,542 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2018-12-02 07:02:45,542 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-02 07:02:45,591 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 109 states and 129 transitions. Complement of second has 13 states. [2018-12-02 07:02:45,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 07:02:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 07:02:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-12-02 07:02:45,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 12 letters. Loop has 13 letters. [2018-12-02 07:02:45,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:45,592 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:02:45,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:45,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:45,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 07:02:45,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 07:02:45,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-02 07:02:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:45,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:45,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-12-02 07:02:45,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-12-02 07:02:45,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-02 07:02:45,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:45,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-12-02 07:02:45,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-02 07:02:45,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:02:45,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,775 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-02 07:02:45,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:02:45,817 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,822 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-02 07:02:45,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:02:45,828 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,834 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:45,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:02:45,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:02:45,861 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-12-02 07:02:46,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:46,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-12-02 07:02:46,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:46,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:02:46,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:46,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:46,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:46,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2018-12-02 07:02:46,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:46,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-12-02 07:02:46,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:46,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:46,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-12-02 07:02:46,178 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:46,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:46,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:46,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2018-12-02 07:02:46,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:46,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-02 07:02:46,217 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:46,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:46,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-02 07:02:46,232 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:46,242 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:02:46,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-02 07:02:46,260 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:119, output treesize:93 [2018-12-02 07:02:46,518 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-12-02 07:02:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:46,575 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 9 loop predicates [2018-12-02 07:02:46,575 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 12 states. [2018-12-02 07:03:37,145 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-12-02 07:03:37,325 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2018-12-02 07:04:25,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 12 states. Result 109 states and 127 transitions. Complement of second has 27 states. [2018-12-02 07:04:25,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 3 stem states 11 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 07:04:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-12-02 07:04:25,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. Stem has 12 letters. Loop has 13 letters. [2018-12-02 07:04:25,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:25,511 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:04:25,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:25,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:25,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:25,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 07:04:25,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:25,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:25,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 07:04:25,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-02 07:04:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:25,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:25,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:25,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-12-02 07:04:25,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:25,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-12-02 07:04:25,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-02 07:04:25,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:25,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-12-02 07:04:25,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-02 07:04:25,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:25,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-02 07:04:25,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:25,738 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,743 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-02 07:04:25,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:25,748 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,754 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:04:25,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:04:25,810 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2018-12-02 07:04:25,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:25,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 07:04:25,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:25,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:25,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:25,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-12-02 07:04:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 07:04:25,853 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2018-12-02 07:04:25,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-02 07:04:25,914 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 141 states and 167 transitions. Complement of second has 15 states. [2018-12-02 07:04:25,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 07:04:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-12-02 07:04:25,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 12 letters. Loop has 13 letters. [2018-12-02 07:04:25,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:25,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 25 letters. Loop has 13 letters. [2018-12-02 07:04:25,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:25,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 12 letters. Loop has 26 letters. [2018-12-02 07:04:25,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:25,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 167 transitions. [2018-12-02 07:04:25,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-12-02 07:04:25,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 110 states and 130 transitions. [2018-12-02 07:04:25,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-02 07:04:25,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-02 07:04:25,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 130 transitions. [2018-12-02 07:04:25,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:04:25,919 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 130 transitions. [2018-12-02 07:04:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 130 transitions. [2018-12-02 07:04:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2018-12-02 07:04:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-02 07:04:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2018-12-02 07:04:25,922 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2018-12-02 07:04:25,922 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2018-12-02 07:04:25,922 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 07:04:25,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 112 transitions. [2018-12-02 07:04:25,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-12-02 07:04:25,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:04:25,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:04:25,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-02 07:04:25,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:25,923 INFO L794 eck$LassoCheckResult]: Stem: 2355#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2350#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2351#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2400#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2397#L551-3 main_#t~short9 := main_#t~short7; 2398#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2365#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 2356#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2357#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 2360#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2362#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2346#L551-3 main_#t~short9 := main_#t~short7; 2347#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2353#L551-6 [2018-12-02 07:04:25,923 INFO L796 eck$LassoCheckResult]: Loop: 2353#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 2373#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2369#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 2370#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2423#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2422#L551-3 main_#t~short9 := main_#t~short7; 2352#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2353#L551-6 [2018-12-02 07:04:25,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash -273668037, now seen corresponding path program 3 times [2018-12-02 07:04:25,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:25,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:25,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:25,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:25,936 INFO L82 PathProgramCache]: Analyzing trace with hash -949832095, now seen corresponding path program 2 times [2018-12-02 07:04:25,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:25,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:25,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1984317209, now seen corresponding path program 1 times [2018-12-02 07:04:25,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:25,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:25,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:25,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:26,091 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2018-12-02 07:04:26,194 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-12-02 07:04:26,506 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 116 [2018-12-02 07:04:26,905 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-12-02 07:04:26,908 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:04:26,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:04:26,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:04:26,908 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:04:26,908 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:04:26,908 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:04:26,908 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:04:26,908 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:04:26,908 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-02 07:04:26,908 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:04:26,908 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:04:26,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-12-02 07:04:26,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:26,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-12-02 07:04:26,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:26,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:26,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:26,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:26,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:26,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:26,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:26,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:26,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:27,264 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-12-02 07:04:27,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:27,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:27,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:27,659 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:04:27,659 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:04:27,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:27,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:27,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:27,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:27,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:27,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:27,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:27,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:27,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:27,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:27,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:27,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:27,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:27,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,669 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:27,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,669 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:27,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:27,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:27,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:27,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:27,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,673 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:27,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,673 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:27,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,675 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:27,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,676 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:27,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,684 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:27,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,684 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:27,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:27,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:27,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:27,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:27,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:27,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:27,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:27,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:27,691 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:04:27,693 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 07:04:27,694 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 07:04:27,694 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:04:27,694 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:04:27,694 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:04:27,694 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-12-02 07:04:27,757 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 07:04:27,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:04:27,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:27,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:27,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-02 07:04:27,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:04:27,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 07:04:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:27,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:27,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-12-02 07:04:27,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:27,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:27,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:27,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-12-02 07:04:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:27,859 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-02 07:04:27,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-02 07:04:27,926 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 181 states and 222 transitions. Complement of second has 12 states. [2018-12-02 07:04:27,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 07:04:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-12-02 07:04:27,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2018-12-02 07:04:27,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:27,927 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:04:27,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:27,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:27,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-02 07:04:27,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:04:27,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 07:04:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:27,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:27,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-12-02 07:04:27,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:27,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:27,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:27,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-12-02 07:04:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:28,033 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-02 07:04:28,033 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-02 07:04:28,100 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 181 states and 222 transitions. Complement of second has 12 states. [2018-12-02 07:04:28,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 07:04:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-12-02 07:04:28,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2018-12-02 07:04:28,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:28,101 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:04:28,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:28,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:28,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-02 07:04:28,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:28,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:28,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:04:28,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 07:04:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:28,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:28,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:28,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-12-02 07:04:28,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:28,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:28,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:28,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:28,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-12-02 07:04:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:28,204 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-02 07:04:28,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-02 07:04:28,276 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 237 states and 291 transitions. Complement of second has 13 states. [2018-12-02 07:04:28,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 07:04:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-12-02 07:04:28,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 13 letters. Loop has 7 letters. [2018-12-02 07:04:28,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:28,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2018-12-02 07:04:28,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:28,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 13 letters. Loop has 14 letters. [2018-12-02 07:04:28,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:28,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 291 transitions. [2018-12-02 07:04:28,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-12-02 07:04:28,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 182 states and 218 transitions. [2018-12-02 07:04:28,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-02 07:04:28,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-02 07:04:28,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 218 transitions. [2018-12-02 07:04:28,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:04:28,281 INFO L705 BuchiCegarLoop]: Abstraction has 182 states and 218 transitions. [2018-12-02 07:04:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 218 transitions. [2018-12-02 07:04:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 143. [2018-12-02 07:04:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-02 07:04:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2018-12-02 07:04:28,284 INFO L728 BuchiCegarLoop]: Abstraction has 143 states and 174 transitions. [2018-12-02 07:04:28,284 INFO L608 BuchiCegarLoop]: Abstraction has 143 states and 174 transitions. [2018-12-02 07:04:28,285 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 07:04:28,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 174 transitions. [2018-12-02 07:04:28,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-12-02 07:04:28,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:04:28,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:04:28,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-02 07:04:28,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:28,286 INFO L794 eck$LassoCheckResult]: Stem: 3408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3402#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 3403#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3460#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3458#L551-3 main_#t~short9 := main_#t~short7; 3457#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3432#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3409#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3410#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 3413#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3415#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3436#L551-3 main_#t~short9 := main_#t~short7; 3433#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3434#L551-6 [2018-12-02 07:04:28,286 INFO L796 eck$LassoCheckResult]: Loop: 3434#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3451#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3450#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 3449#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3448#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3447#L551-3 main_#t~short9 := main_#t~short7; 3445#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3434#L551-6 [2018-12-02 07:04:28,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash -273668037, now seen corresponding path program 4 times [2018-12-02 07:04:28,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:28,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:28,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:28,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:28,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:28,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:28,298 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 1 times [2018-12-02 07:04:28,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:28,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:28,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:28,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:28,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:28,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:28,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1982470167, now seen corresponding path program 5 times [2018-12-02 07:04:28,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:28,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:28,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:28,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:28,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:28,442 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-12-02 07:04:28,842 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 116 [2018-12-02 07:04:29,620 WARN L180 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-12-02 07:04:29,624 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:04:29,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:04:29,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:04:29,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:04:29,624 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:04:29,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:04:29,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:04:29,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:04:29,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration8_Lasso [2018-12-02 07:04:29,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:04:29,624 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:04:29,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:29,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:30,124 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-12-02 07:04:30,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:30,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:30,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:04:30,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:04:30,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:30,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:30,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:30,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:30,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:30,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:30,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,591 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,591 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:30,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,595 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,596 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:30,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,602 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,602 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:30,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,603 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 07:04:30,603 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,611 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,611 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:30,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:30,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:30,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:30,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:30,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,617 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-02 07:04:30,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,618 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,618 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,618 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,619 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,619 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,619 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,621 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,621 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,621 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,623 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,623 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,624 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,625 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,625 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,626 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,626 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,627 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,627 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,627 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,628 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,628 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,629 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,629 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,629 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,631 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,631 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,632 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,633 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,633 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,636 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,636 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,636 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,638 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,638 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,641 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,641 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,648 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,648 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,648 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,648 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,651 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,651 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,651 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,654 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,654 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,654 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,654 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,657 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,657 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,657 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,660 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,660 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,660 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,662 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,662 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:30,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,664 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-12-02 07:04:30,664 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-02 07:04:30,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,679 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,679 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,679 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,679 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,682 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,682 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,683 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,683 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,684 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,684 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,684 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,685 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-02 07:04:30,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,686 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,686 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,686 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,688 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,688 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,690 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,690 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,692 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:30,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,693 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,693 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:30,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,694 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,694 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:30,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,695 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:30,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,696 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,696 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,696 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,698 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:30,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,699 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,699 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,701 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,701 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:30,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,702 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,703 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,703 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,707 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,707 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,708 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,709 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,709 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,712 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,713 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,713 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,721 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,721 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,722 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 07:04:30,722 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,724 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,725 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,725 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,728 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,728 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,729 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 07:04:30,729 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,732 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,732 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,732 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,735 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,736 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,736 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,738 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,739 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:30,739 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,741 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-12-02 07:04:30,741 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-02 07:04:30,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,761 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,761 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 07:04:30,761 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,765 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,765 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,766 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,766 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:30,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,767 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:30,768 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:30,768 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:30,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,769 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-02 07:04:30,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,769 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,770 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,770 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,771 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,772 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,772 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,774 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,774 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,775 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,776 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,776 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:30,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,777 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,778 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:30,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,779 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,779 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:30,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,780 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:30,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,781 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,782 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,782 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,783 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,783 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:30,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,785 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,785 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,785 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,794 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,794 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:30,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,795 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,796 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,796 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,800 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,801 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,802 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,803 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,803 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,824 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,825 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,825 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,834 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,834 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,835 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 07:04:30,835 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,838 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,839 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,839 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,842 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,842 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,843 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 07:04:30,850 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,853 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,854 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,854 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,857 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,858 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,858 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,861 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,862 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:30,862 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,864 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2018-12-02 07:04:30,865 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-12-02 07:04:30,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,902 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:30,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,904 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 07:04:30,904 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,907 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,908 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,908 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,909 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,910 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:30,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:30,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,911 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:30,911 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:30,911 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:30,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,913 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-02 07:04:30,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,917 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,917 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,917 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,918 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,919 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,919 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,920 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,920 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,922 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,922 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,923 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,923 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,924 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,947 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,949 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,949 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,949 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,949 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,951 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,951 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,952 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,953 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,972 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,973 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,974 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,975 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,975 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:30,975 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:30,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,978 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:30,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,978 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,978 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:30,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:30,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:30,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:30,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:30,980 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:30,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:30,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:30,980 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:30,981 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:31,000 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,004 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:31,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:31,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,004 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,004 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:31,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:31,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,006 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:31,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,006 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,007 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:31,007 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,012 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:31,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,012 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,013 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:31,013 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,026 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:31,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,026 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,027 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:31,027 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,031 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:31,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,031 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,033 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:31,033 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,044 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,044 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:31,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,044 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,045 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:31,045 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,049 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:31,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,056 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,057 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:31,057 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,061 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,061 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,061 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:31,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,062 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,062 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:31,062 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:31,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,066 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,067 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:31,067 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,071 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,071 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:31,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:31,071 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,072 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:31,085 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:31,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:31,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:31,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:31,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:31,089 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:31,089 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:31,089 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:31,092 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-12-02 07:04:31,092 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-02 07:04:31,158 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:04:31,192 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 07:04:31,192 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 07:04:31,193 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:04:31,194 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-12-02 07:04:31,194 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:04:31,195 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_7 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_7 Supporting invariants [] [2018-12-02 07:04:31,364 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 07:04:31,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:04:31,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:04:31,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:04:31,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:31,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:31,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:31,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 07:04:31,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:31,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:31,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 07:04:31,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-02 07:04:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:31,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:31,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:31,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-02 07:04:31,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:31,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:31,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:31,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:31,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:31,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-02 07:04:31,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:31,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:31,568 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:31,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:31,578 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,598 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:31,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-12-02 07:04:31,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:31,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 07:04:31,651 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-02 07:04:31,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:31,661 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,665 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,670 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:31,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:04:31,687 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-12-02 07:04:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:31,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 07:04:31,713 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 174 transitions. cyclomatic complexity: 40 Second operand 5 states. [2018-12-02 07:04:31,780 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 174 transitions. cyclomatic complexity: 40. Second operand 5 states. Result 312 states and 370 transitions. Complement of second has 8 states. [2018-12-02 07:04:31,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:04:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-02 07:04:31,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2018-12-02 07:04:31,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:31,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2018-12-02 07:04:31,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:31,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 14 letters. [2018-12-02 07:04:31,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:31,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 370 transitions. [2018-12-02 07:04:31,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-12-02 07:04:31,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 221 states and 265 transitions. [2018-12-02 07:04:31,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-02 07:04:31,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-02 07:04:31,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 265 transitions. [2018-12-02 07:04:31,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:04:31,783 INFO L705 BuchiCegarLoop]: Abstraction has 221 states and 265 transitions. [2018-12-02 07:04:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 265 transitions. [2018-12-02 07:04:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 179. [2018-12-02 07:04:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-02 07:04:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 218 transitions. [2018-12-02 07:04:31,787 INFO L728 BuchiCegarLoop]: Abstraction has 179 states and 218 transitions. [2018-12-02 07:04:31,787 INFO L608 BuchiCegarLoop]: Abstraction has 179 states and 218 transitions. [2018-12-02 07:04:31,787 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 07:04:31,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 218 transitions. [2018-12-02 07:04:31,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-12-02 07:04:31,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:04:31,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:04:31,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-12-02 07:04:31,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:31,789 INFO L794 eck$LassoCheckResult]: Stem: 4050#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4044#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 4045#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4093#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4092#L551-3 main_#t~short9 := main_#t~short7; 4091#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4063#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 4064#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4121#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 4085#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4086#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4081#L551-3 main_#t~short9 := main_#t~short7; 4082#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4076#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 4077#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4072#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 4073#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4112#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4141#L551-3 main_#t~short9 := main_#t~short7; 4089#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4090#L551-6 [2018-12-02 07:04:31,789 INFO L796 eck$LassoCheckResult]: Loop: 4090#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 4059#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4060#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 4055#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4056#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4046#L551-3 main_#t~short9 := main_#t~short7; 4047#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4090#L551-6 [2018-12-02 07:04:31,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2054331691, now seen corresponding path program 2 times [2018-12-02 07:04:31,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:31,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:31,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:31,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:31,803 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 2 times [2018-12-02 07:04:31,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:31,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:31,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:31,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:31,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:31,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash 742589689, now seen corresponding path program 3 times [2018-12-02 07:04:31,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:31,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:31,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:31,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:31,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:31,953 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-12-02 07:04:32,934 WARN L180 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 153 [2018-12-02 07:04:33,763 WARN L180 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 113 [2018-12-02 07:04:33,765 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:04:33,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:04:33,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:04:33,765 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:04:33,765 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:04:33,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:04:33,765 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:04:33,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:04:33,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration9_Lasso [2018-12-02 07:04:33,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:04:33,766 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:04:33,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:33,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:34,243 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2018-12-02 07:04:34,347 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-12-02 07:04:34,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:34,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:34,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:34,678 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:04:34,678 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:04:34,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:34,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:34,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:34,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:34,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:34,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,693 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,694 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:34,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,698 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,698 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:34,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,702 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,702 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:34,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,709 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:34,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,710 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 07:04:34,710 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:34,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:34,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:34,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:34,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:34,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,724 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-02 07:04:34,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,725 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,725 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,726 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,726 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,726 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,727 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,727 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,727 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,729 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,729 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,730 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,730 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:34,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,731 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:34,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,732 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,732 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,733 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,733 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,733 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,735 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,735 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:34,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,736 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,736 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:34,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,736 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,737 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,737 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,738 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,738 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:34,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,739 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,739 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,739 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,741 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,741 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,741 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,741 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,743 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,744 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,744 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,746 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,746 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,747 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,747 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,749 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,749 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,749 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,751 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,751 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,752 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,752 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,754 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,754 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,755 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,760 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,760 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,760 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,761 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,761 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:34,761 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,762 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-12-02 07:04:34,762 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-02 07:04:34,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,783 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,783 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,786 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,786 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,788 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,788 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:34,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,789 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,789 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:34,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,790 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:34,790 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:34,790 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:34,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,791 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-02 07:04:34,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,792 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,792 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,793 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,794 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,794 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,795 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,795 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,797 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,797 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,799 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:34,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,799 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,800 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:34,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,800 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,801 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,801 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,802 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,802 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,804 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:34,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,805 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:34,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,806 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,806 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,806 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,808 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,808 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:34,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,809 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,809 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,809 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,812 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,812 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 07:04:34,812 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,815 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,815 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,815 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,818 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,819 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,819 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 07:04:34,819 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,822 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,822 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,824 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,825 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 07:04:34,825 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,829 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,830 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,837 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,837 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,837 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,838 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,838 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:34,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,840 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-12-02 07:04:34,840 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-02 07:04:34,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,860 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,860 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,865 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,865 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,867 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,868 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:34,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,868 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,869 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 07:04:34,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,869 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 07:04:34,870 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:34,870 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 07:04:34,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,871 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-02 07:04:34,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,896 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:34,896 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:34,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,897 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,898 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:34,898 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:34,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,899 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,899 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:34,899 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:34,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,901 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,901 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:34,901 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:34,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,924 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,924 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:34,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,925 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,925 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:34,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,926 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,926 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:34,926 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:34,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,953 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,953 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:34,953 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:34,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,956 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:34,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,958 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:34,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,959 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,960 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:34,960 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:34,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:34,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,984 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,984 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:34,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:34,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,985 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,986 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:34,986 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:34,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,989 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:34,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,989 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,990 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 07:04:34,990 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:34,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:34,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:34,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:34,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:34,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:34,995 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:34,996 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:34,996 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:35,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,017 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:35,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,017 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,018 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 07:04:35,018 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:35,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,021 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:35,021 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:35,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,024 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:35,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,024 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,025 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 07:04:35,025 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:35,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,029 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,030 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:35,044 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:35,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,054 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,055 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:35,055 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:35,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,056 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:35,057 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:35,057 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,061 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2018-12-02 07:04:35,061 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-12-02 07:04:35,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04: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-12-02 07:04:35,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,102 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,103 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:35,103 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:35,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,107 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,108 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:35,108 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:35,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:35,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,113 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,113 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:35,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:35,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:35,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,114 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,115 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 07:04:35,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:35,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04: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-12-02 07:04:35,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:35,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,116 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 07:04:35,116 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 07:04:35,117 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-02 07:04:35,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,118 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-02 07:04: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-12-02 07:04:35,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,119 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,120 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,120 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,122 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,122 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,123 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,123 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,125 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,125 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,126 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,126 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,128 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,147 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,147 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,147 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,149 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:35,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,150 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,150 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:35,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:35,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,151 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:35,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,151 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,152 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:35,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:35,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04: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-12-02 07:04:35,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,153 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,153 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,181 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,181 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,183 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,184 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,184 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,184 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:35,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,187 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,188 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:35,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:35,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,189 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:35,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,189 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,189 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:35,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:35,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,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-12-02 07:04:35,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,219 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,220 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,220 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,220 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,222 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,222 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:35,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,222 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,223 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 07:04:35,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:35,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,224 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,224 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,225 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,225 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,247 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,248 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,248 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:35,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,248 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,248 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:35,248 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,250 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,251 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,251 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,251 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,251 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,257 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,257 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:35,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,257 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,258 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:35,258 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,261 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,282 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,283 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,283 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,286 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,286 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,286 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:35,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,286 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,286 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 07:04:35,286 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,289 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,289 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,289 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,290 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,290 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,304 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:35,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:35,304 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,305 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 07:04:35,317 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-02 07:04:35,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:35,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:35,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 07:04:35,319 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 07:04:35,319 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:35,319 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 07:04:35,320 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 07:04:35,322 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-12-02 07:04:35,322 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-02 07:04:35,459 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:04:35,482 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 07:04:35,482 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 07:04:35,482 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:04:35,483 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-12-02 07:04:35,483 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:04:35,483 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_8 Supporting invariants [] [2018-12-02 07:04:35,575 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 07:04:35,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:04:35,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:04:35,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:04:35,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:35,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:35,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-02 07:04:35,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:35,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:35,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:04:35,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 07:04:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:35,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:35,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:35,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-02 07:04:35,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:35,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:35,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:35,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:35,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:35,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-12-02 07:04:35,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:35,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 07:04:35,757 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-02 07:04:35,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:35,768 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,774 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,786 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:35,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-02 07:04:35,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:35,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:35,826 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:35,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:35,836 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,839 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,844 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:35,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:04:35,878 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-12-02 07:04:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:35,905 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 07:04:35,905 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50 Second operand 5 states. [2018-12-02 07:04:35,977 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 312 states and 370 transitions. Complement of second has 8 states. [2018-12-02 07:04:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:04:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-02 07:04:35,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2018-12-02 07:04:35,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:35,978 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:04:35,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:36,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:36,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-02 07:04:36,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:04:36,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 07:04:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:36,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:36,059 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 07:04:36,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-12-02 07:04:36,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 07:04:36,123 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-02 07:04:36,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:36,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,138 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-02 07:04:36,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:36,184 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:36,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:36,193 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,201 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-02 07:04:36,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:36,228 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:36,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:36,239 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,242 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,247 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:04:36,264 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-12-02 07:04:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:36,290 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 07:04:36,290 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50 Second operand 5 states. [2018-12-02 07:04:36,352 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 312 states and 370 transitions. Complement of second has 8 states. [2018-12-02 07:04:36,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:04:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-02 07:04:36,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2018-12-02 07:04:36,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:36,353 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:04:36,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:36,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:36,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-02 07:04:36,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:04:36,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 07:04:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:36,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:36,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-02 07:04:36,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:36,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:36,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:36,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-02 07:04:36,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:36,503 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:36,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:36,514 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,519 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-12-02 07:04:36,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:36,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 07:04:36,576 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-02 07:04:36,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:36,587 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,591 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,596 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:36,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:04:36,612 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-12-02 07:04:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:36,641 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 07:04:36,641 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50 Second operand 5 states. [2018-12-02 07:04:36,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 370 states and 448 transitions. Complement of second has 9 states. [2018-12-02 07:04:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:04:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-12-02 07:04:36,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2018-12-02 07:04:36,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:36,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 7 letters. [2018-12-02 07:04:36,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:36,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 14 letters. [2018-12-02 07:04:36,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:36,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 448 transitions. [2018-12-02 07:04:36,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-12-02 07:04:36,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 196 states and 238 transitions. [2018-12-02 07:04:36,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 07:04:36,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-02 07:04:36,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 238 transitions. [2018-12-02 07:04:36,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:04:36,718 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 238 transitions. [2018-12-02 07:04:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 238 transitions. [2018-12-02 07:04:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 154. [2018-12-02 07:04:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-02 07:04:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 187 transitions. [2018-12-02 07:04:36,721 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 187 transitions. [2018-12-02 07:04:36,721 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 187 transitions. [2018-12-02 07:04:36,721 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 07:04:36,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 187 transitions. [2018-12-02 07:04:36,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-12-02 07:04:36,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:04:36,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:04:36,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2018-12-02 07:04:36,722 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-12-02 07:04:36,722 INFO L794 eck$LassoCheckResult]: Stem: 5626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5620#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 5621#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5630#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5622#L551-3 main_#t~short9 := main_#t~short7; 5623#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5638#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 5640#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5635#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 5705#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5703#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5701#L551-3 main_#t~short9 := main_#t~short7; 5699#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5698#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 5650#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5661#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 5657#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5658#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5653#L551-3 main_#t~short9 := main_#t~short7; 5654#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5648#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 5649#L552 [2018-12-02 07:04:36,722 INFO L796 eck$LassoCheckResult]: Loop: 5649#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5707#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 5704#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5702#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5700#L551-3 main_#t~short9 := main_#t~short7; 5697#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5698#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 5650#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5661#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 5657#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5658#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5653#L551-3 main_#t~short9 := main_#t~short7; 5654#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5648#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 5649#L552 [2018-12-02 07:04:36,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1384291310, now seen corresponding path program 4 times [2018-12-02 07:04:36,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:36,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:36,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:36,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash 969712963, now seen corresponding path program 1 times [2018-12-02 07:04:36,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:36,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:36,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:36,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:36,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:36,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1247996012, now seen corresponding path program 5 times [2018-12-02 07:04:36,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:04:36,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:04:36,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:36,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:36,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:04:37,016 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 97 [2018-12-02 07:04:37,595 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 144 [2018-12-02 07:04:37,694 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:04:37,694 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:04:37,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:04:37,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:04:37,694 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:04:37,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:04:37,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:04:37,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:04:37,694 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration10_Lasso [2018-12-02 07:04:37,694 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:04:37,694 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:04:37,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:37,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:04:38,184 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:04:38,184 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:04:38,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:04:38,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:38,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:04:38,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:04:38,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:38,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:38,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:38,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:38,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:38,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:38,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:38,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:38,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,193 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:38,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,193 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:38,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:38,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:38,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,196 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:04:38,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,196 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:04:38,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:38,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:38,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:38,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:38,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:04:38,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:04:38,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:04:38,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:04:38,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:04:38,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:04:38,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:04:38,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:04:38,201 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:04:38,202 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:04:38,202 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:04:38,203 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:04:38,203 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:04:38,203 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:04:38,203 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9 Supporting invariants [] [2018-12-02 07:04:38,257 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 07:04:38,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:04:38,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:38,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:38,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:38,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 07:04:38,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:38,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:38,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 07:04:38,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-02 07:04:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:38,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:38,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:38,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-12-02 07:04:38,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:38,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-02 07:04:38,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 07:04:38,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:38,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:16 [2018-12-02 07:04:38,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:38,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-12-02 07:04:38,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:38,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 07:04:38,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 07:04:38,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:38,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:38,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:18 [2018-12-02 07:04:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 07:04:38,432 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-02 07:04:38,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 187 transitions. cyclomatic complexity: 42 Second operand 8 states. [2018-12-02 07:04:38,515 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 187 transitions. cyclomatic complexity: 42. Second operand 8 states. Result 411 states and 509 transitions. Complement of second has 11 states. [2018-12-02 07:04:38,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 07:04:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 07:04:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-12-02 07:04:38,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 14 letters. [2018-12-02 07:04:38,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:38,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 35 letters. Loop has 14 letters. [2018-12-02 07:04:38,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:38,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 28 letters. [2018-12-02 07:04:38,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:04:38,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 509 transitions. [2018-12-02 07:04:38,518 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:04:38,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 0 states and 0 transitions. [2018-12-02 07:04:38,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 07:04:38,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 07:04:38,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 07:04:38,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:04:38,519 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:04:38,519 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:04:38,519 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:04:38,519 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 07:04:38,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:04:38,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:04:38,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 07:04:38,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 07:04:38 BoogieIcfgContainer [2018-12-02 07:04:38,525 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 07:04:38,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:04:38,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:04:38,526 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:04:38,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:02:39" (3/4) ... [2018-12-02 07:04:38,530 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 07:04:38,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:04:38,530 INFO L168 Benchmark]: Toolchain (without parser) took 119825.23 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.0 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -242.1 MB). Peak memory consumption was 232.9 MB. Max. memory is 11.5 GB. [2018-12-02 07:04:38,531 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:04:38,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-02 07:04:38,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:04:38,532 INFO L168 Benchmark]: Boogie Preprocessor took 14.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:04:38,532 INFO L168 Benchmark]: RCFGBuilder took 145.86 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:04:38,532 INFO L168 Benchmark]: BuchiAutomizer took 119389.95 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 334.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.5 MB). Peak memory consumption was 235.5 MB. Max. memory is 11.5 GB. [2018-12-02 07:04:38,532 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-02 07:04:38,534 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 145.86 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 119389.95 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 334.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.5 MB). Peak memory consumption was 235.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (1 trivial, 5 deterministic, 4 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has 2-phase ranking function (if unknown-#memory_int-unknown[z][z] > 0 then 1 else 0), (if unknown-#memory_int-unknown[z][z] > 0 then unknown-#memory_int-unknown[z][z] else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@1d5dd6b and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has 2-phase ranking function (if unknown-#memory_int-unknown[z][z] > 0 then 1 else 0), (if unknown-#memory_int-unknown[z][z] > 0 then unknown-#memory_int-unknown[z][z] else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 119.3s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 15.4s. Construction of modules took 98.2s. Büchi inclusion checks took 5.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 170 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 179 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/13 HoareTripleCheckerStatistics: 166 SDtfs, 299 SDslu, 129 SDs, 0 SdLazy, 526 SolverSat, 121 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 98.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso9 LassoPreprocessingBenchmarks: Lassos: inital492 mio100 ax105 hnf99 lsp77 ukn67 mio100 lsp33 div100 bol101 ite100 ukn100 eq186 hnf88 smp97 dnf123 smp86 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 10 MotzkinApplications: 50 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...