./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/array01-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/array01-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 10c50c605d9fb7cd886e3d668ba568a2b619230b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:31,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:31,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:31,855 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:31,856 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:31,857 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:31,860 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:31,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:31,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:31,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:31,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:31,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:31,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:31,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:31,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:31,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:31,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:31,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:31,877 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:31,879 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:31,880 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:31,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:31,884 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:31,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:31,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:31,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:31,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:31,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:31,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:31,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:31,891 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:31,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:31,891 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:31,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:31,893 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:31,894 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:31,894 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:31,911 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:31,911 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:31,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:31,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:31,914 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:31,914 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:31,914 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:31,914 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:31,914 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:31,914 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:31,915 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:31,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:31,915 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:31,915 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:31,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:31,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:31,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:31,917 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:31,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:31,918 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:31,918 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:31,918 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:31,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:31,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:31,919 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:31,919 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:31,919 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:31,920 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:31,921 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:31,922 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 10c50c605d9fb7cd886e3d668ba568a2b619230b [2018-11-28 23:19:31,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:31,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:31,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:31,998 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:31,999 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:31,999 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2018-11-28 23:19:32,056 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6654f7ff5/b4d4783c4d3f4bb29c85711b481458d8/FLAGf0281e9bf [2018-11-28 23:19:32,589 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:32,590 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2018-11-28 23:19:32,610 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6654f7ff5/b4d4783c4d3f4bb29c85711b481458d8/FLAGf0281e9bf [2018-11-28 23:19:32,844 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6654f7ff5/b4d4783c4d3f4bb29c85711b481458d8 [2018-11-28 23:19:32,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:32,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:32,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:32,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:32,856 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:32,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:32" (1/1) ... [2018-11-28 23:19:32,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0c55c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:32, skipping insertion in model container [2018-11-28 23:19:32,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:32" (1/1) ... [2018-11-28 23:19:32,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:32,917 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:33,216 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:33,234 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:33,322 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:33,381 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:33,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33 WrapperNode [2018-11-28 23:19:33,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:33,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:33,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:33,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:33,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... [2018-11-28 23:19:33,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... [2018-11-28 23:19:33,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:33,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:33,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:33,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:33,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... [2018-11-28 23:19:33,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... [2018-11-28 23:19:33,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... [2018-11-28 23:19:33,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... [2018-11-28 23:19:33,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... [2018-11-28 23:19:33,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... [2018-11-28 23:19:33,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... [2018-11-28 23:19:33,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:33,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:33,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:33,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:33,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:33,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:34,022 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:34,022 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:19:34,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:34 BoogieIcfgContainer [2018-11-28 23:19:34,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:34,023 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:34,023 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:34,028 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:34,029 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:34,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:32" (1/3) ... [2018-11-28 23:19:34,030 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18211e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:34, skipping insertion in model container [2018-11-28 23:19:34,031 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:34,031 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:33" (2/3) ... [2018-11-28 23:19:34,031 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18211e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:34, skipping insertion in model container [2018-11-28 23:19:34,031 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:34,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:34" (3/3) ... [2018-11-28 23:19:34,043 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-termination.c.i [2018-11-28 23:19:34,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:34,129 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:34,129 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:34,130 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:34,130 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:34,130 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:34,130 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:34,131 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:34,131 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:34,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:19:34,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:34,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:34,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:34,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:34,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:19:34,179 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:34,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:19:34,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:34,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:34,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:34,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:34,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:19:34,192 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L561true assume !(main_~array_size~0 < 1); 14#L561-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 3#L551-3true [2018-11-28 23:19:34,192 INFO L796 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N); 12#L552-3true assume !true; 13#L551-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 3#L551-3true [2018-11-28 23:19:34,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 23:19:34,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:34,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:34,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:34,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:34,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-11-28 23:19:34,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:34,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:34,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:34,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:19:34,371 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:34,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:19:34,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:19:34,392 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-28 23:19:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:34,399 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-11-28 23:19:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:19:34,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-28 23:19:34,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:34,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-11-28 23:19:34,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:19:34,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:19:34,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-28 23:19:34,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:34,410 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:19:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-28 23:19:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-28 23:19:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:19:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-28 23:19:34,442 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:19:34,442 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:19:34,442 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:34,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-28 23:19:34,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:34,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:34,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:34,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:34,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:34,444 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L561 assume !(main_~array_size~0 < 1); 41#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 36#L551-3 [2018-11-28 23:19:34,444 INFO L796 eck$LassoCheckResult]: Loop: 36#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 37#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 40#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 36#L551-3 [2018-11-28 23:19:34,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 23:19:34,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:34,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:34,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:34,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:34,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-11-28 23:19:34,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:34,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:34,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:34,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-11-28 23:19:34,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:34,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:34,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:35,013 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:19:35,127 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-28 23:19:35,138 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:35,139 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:35,139 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:35,139 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:35,140 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:35,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:35,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:35,140 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:35,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:19:35,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:35,141 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:35,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,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-11-28 23:19:35,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,495 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-28 23:19:35,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:35,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:36,467 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:36,472 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:36,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:36,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:36,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:36,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:36,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:36,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:36,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:36,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:36,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:36,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:36,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:36,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:36,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:36,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:36,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:36,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:36,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:36,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:36,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:36,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:36,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:36,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:36,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:36,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:36,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:36,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:36,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:36,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:36,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:36,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:36,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:36,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:36,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:36,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:36,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:36,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:36,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:36,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:36,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:36,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:36,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:36,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:36,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:36,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:36,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:36,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:36,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:36,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:36,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:36,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:36,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:36,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:36,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:36,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:36,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:36,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:36,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:36,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:36,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:36,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:36,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:36,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:36,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:36,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:36,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:36,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:36,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:36,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:36,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:36,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:36,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:36,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:36,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:36,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:36,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:36,687 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:36,756 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:19:36,758 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:19:36,761 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:36,764 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:36,769 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:36,770 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-28 23:19:36,828 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:19:36,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:36,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:36,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:36,971 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:36,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 23:19:37,017 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2018-11-28 23:19:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 23:19:37,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 23:19:37,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:37,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:19:37,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:37,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-28 23:19:37,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:37,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-28 23:19:37,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:37,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-11-28 23:19:37,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:19:37,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:19:37,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-28 23:19:37,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:37,028 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:19:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-28 23:19:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-28 23:19:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:19:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-28 23:19:37,030 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 23:19:37,030 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 23:19:37,030 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:37,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-28 23:19:37,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:37,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:37,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:37,031 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:37,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:37,032 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 116#L561 assume !(main_~array_size~0 < 1); 121#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 111#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L552-3 [2018-11-28 23:19:37,032 INFO L796 eck$LassoCheckResult]: Loop: 113#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 118#L552-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 113#L552-3 [2018-11-28 23:19:37,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-28 23:19:37,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:37,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:37,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:37,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:37,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-28 23:19:37,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:37,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:37,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:37,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-28 23:19:37,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:37,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:37,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,510 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-11-28 23:19:37,564 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:37,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:37,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:37,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:37,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:37,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:37,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:37,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:37,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:19:37,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:37,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:37,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,191 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:38,191 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19: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-11-28 23:19:38,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19: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-11-28 23:19:38,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:38,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:38,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:38,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:38,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:38,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:38,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:38,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:38,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:38,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:38,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,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-11-28 23:19:38,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:38,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:38,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:38,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:38,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:38,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:38,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,353 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:38,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,356 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:38,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:38,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:38,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:38,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:38,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:38,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:38,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:38,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:38,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:38,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:38,389 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:38,395 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:38,395 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:38,396 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:38,396 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:19:38,396 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:38,396 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-28 23:19:38,482 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:19:38,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:38,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:38,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:38,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:38,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:38,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:19:38,877 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 7 states. [2018-11-28 23:19:38,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 23:19:38,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:19:38,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:38,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:19:38,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:38,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:19:38,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:38,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-28 23:19:38,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:38,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-11-28 23:19:38,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:19:38,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:19:38,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 23:19:38,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:38,888 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:19:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 23:19:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-28 23:19:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:19:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-28 23:19:38,891 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-28 23:19:38,891 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-28 23:19:38,891 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:19:38,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-28 23:19:38,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:38,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:38,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:38,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:38,893 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:38,893 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 205#L561 assume !(main_~array_size~0 < 1); 210#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 199#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 200#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 208#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 209#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 201#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 203#L552-3 [2018-11-28 23:19:38,893 INFO L796 eck$LassoCheckResult]: Loop: 203#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 207#L552-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 203#L552-3 [2018-11-28 23:19:38,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-11-28 23:19:38,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:38,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:38,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:38,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:38,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-28 23:19:38,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:38,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:38,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:38,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:38,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:38,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-11-28 23:19:38,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:38,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:38,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:39,088 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:19:39,515 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-11-28 23:19:39,579 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:39,579 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:39,579 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:39,579 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:39,579 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:39,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:39,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:39,580 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:39,580 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:19:39,580 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:39,580 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:39,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,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-11-28 23:19:39,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,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-11-28 23:19:39,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,162 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:40,163 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:40,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:40,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:40,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,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-11-28 23:19:40,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:40,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:40,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:40,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:40,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:40,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:40,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,309 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:40,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,315 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:40,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:40,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:40,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:40,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:40,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:40,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:40,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:40,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:40,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:40,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:40,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:40,338 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:40,340 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:40,340 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:40,341 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:40,341 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:19:40,342 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:40,342 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-28 23:19:40,418 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:19:40,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:40,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:40,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:40,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:40,547 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:40,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:19:40,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2018-11-28 23:19:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 23:19:40,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:19:40,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:40,609 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:40,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:40,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:40,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:40,723 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:40,724 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:19:40,748 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2018-11-28 23:19:40,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 23:19:40,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:19:40,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:40,750 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:40,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:40,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:40,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:40,799 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 2 loop predicates [2018-11-28 23:19:40,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:19:40,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 6 states. [2018-11-28 23:19:40,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:19:40,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:19:40,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:40,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 23:19:40,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:40,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:19:40,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:40,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-28 23:19:40,828 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:40,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-11-28 23:19:40,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:19:40,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:19:40,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:19:40,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:40,829 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:40,829 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:40,829 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:40,829 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:19:40,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:19:40,829 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:40,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:19:40,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:19:40 BoogieIcfgContainer [2018-11-28 23:19:40,836 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:19:40,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:19:40,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:19:40,836 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:19:40,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:34" (3/4) ... [2018-11-28 23:19:40,841 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:19:40,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:19:40,842 INFO L168 Benchmark]: Toolchain (without parser) took 7992.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 954.0 MB in the beginning and 1.0 GB in the end (delta: -70.7 MB). Peak memory consumption was 153.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:40,844 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:40,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.39 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 932.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:40,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -206.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:40,847 INFO L168 Benchmark]: Boogie Preprocessor took 43.51 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-11-28 23:19:40,848 INFO L168 Benchmark]: RCFGBuilder took 442.17 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:40,848 INFO L168 Benchmark]: BuchiAutomizer took 6812.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.0 MB). Peak memory consumption was 167.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:40,850 INFO L168 Benchmark]: Witness Printer took 4.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:40,856 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 530.39 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 932.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 150.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -206.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.51 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 442.17 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6812.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.0 MB). Peak memory consumption was 167.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 33 SDslu, 1 SDs, 0 SdLazy, 43 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax113 hnf99 lsp79 ukn79 mio100 lsp58 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...