./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 10c50c605d9fb7cd886e3d668ba568a2b619230b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 22:12:18,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:12:18,207 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:12:18,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:12:18,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:12:18,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:12:18,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:12:18,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:12:18,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:12:18,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:12:18,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:12:18,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:12:18,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:12:18,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:12:18,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:12:18,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:12:18,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:12:18,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:12:18,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:12:18,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:12:18,227 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:12:18,228 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:12:18,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:12:18,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:12:18,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:12:18,230 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:12:18,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:12:18,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:12:18,231 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:12:18,232 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:12:18,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:12:18,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:12:18,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:12:18,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:12:18,233 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:12:18,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:12:18,234 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 22:12:18,243 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:12:18,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:12:18,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 22:12:18,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 22:12:18,244 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 22:12:18,244 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 22:12:18,245 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 22:12:18,245 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 22:12:18,245 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 22:12:18,245 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 22:12:18,245 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 22:12:18,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:12:18,245 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 22:12:18,246 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:12:18,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:12:18,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 22:12:18,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 22:12:18,246 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 22:12:18,246 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 22:12:18,246 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 22:12:18,246 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 22:12:18,247 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 22:12:18,247 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:12:18,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:12:18,247 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 22:12:18,247 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:12:18,247 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 22:12:18,247 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 22:12:18,248 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 22:12:18,248 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10c50c605d9fb7cd886e3d668ba568a2b619230b [2018-12-02 22:12:18,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:12:18,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:12:18,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:12:18,278 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:12:18,278 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:12:18,278 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2018-12-02 22:12:18,314 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/data/9ff8ffaf8/666009e86a6645bd98103f023d2fc09c/FLAGa0fe5c981 [2018-12-02 22:12:18,727 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:12:18,728 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2018-12-02 22:12:18,733 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/data/9ff8ffaf8/666009e86a6645bd98103f023d2fc09c/FLAGa0fe5c981 [2018-12-02 22:12:18,742 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/data/9ff8ffaf8/666009e86a6645bd98103f023d2fc09c [2018-12-02 22:12:18,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:12:18,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:12:18,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:12:18,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:12:18,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:12:18,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:18,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e50d1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18, skipping insertion in model container [2018-12-02 22:12:18,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:18,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:12:18,771 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:12:18,906 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:12:18,944 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:12:18,967 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:12:18,986 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:12:18,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18 WrapperNode [2018-12-02 22:12:18,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:12:18,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:12:18,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:12:18,987 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:12:18,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:19,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:19,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:12:19,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:12:19,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:12:19,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:12:19,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:19,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:19,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:19,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:19,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:19,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:19,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... [2018-12-02 22:12:19,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:12:19,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:12:19,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:12:19,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:12:19,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0008c55-aa3c-4294-80fa-d25a57bd0d30/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:12:19,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 22:12:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 22:12:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 22:12:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 22:12:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:12:19,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:12:19,167 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:12:19,167 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 22:12:19,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:12:19 BoogieIcfgContainer [2018-12-02 22:12:19,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:12:19,168 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 22:12:19,168 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 22:12:19,171 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 22:12:19,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 22:12:19,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 10:12:18" (1/3) ... [2018-12-02 22:12:19,172 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b1f826d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:12:19, skipping insertion in model container [2018-12-02 22:12:19,172 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 22:12:19,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:12:18" (2/3) ... [2018-12-02 22:12:19,172 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b1f826d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:12:19, skipping insertion in model container [2018-12-02 22:12:19,172 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 22:12:19,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:12:19" (3/3) ... [2018-12-02 22:12:19,173 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-termination.c.i [2018-12-02 22:12:19,207 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 22:12:19,208 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 22:12:19,208 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 22:12:19,208 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 22:12:19,208 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:12:19,208 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:12:19,208 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 22:12:19,208 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:12:19,208 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 22:12:19,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-02 22:12:19,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:12:19,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:12:19,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:12:19,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 22:12:19,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 22:12:19,234 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 22:12:19,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-02 22:12:19,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:12:19,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:12:19,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:12:19,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 22:12:19,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 22:12:19,240 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-12-02 22:12:19,240 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-12-02 22:12:19,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-02 22:12:19,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:19,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:19,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:19,314 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-12-02 22:12:19,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:19,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:19,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:19,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:12:19,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:12:19,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 22:12:19,335 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 22:12:19,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 22:12:19,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 22:12:19,345 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-12-02 22:12:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:19,349 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-02 22:12:19,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 22:12:19,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-12-02 22:12:19,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:12:19,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-12-02 22:12:19,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 22:12:19,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 22:12:19,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-12-02 22:12:19,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 22:12:19,355 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-02 22:12:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-12-02 22:12:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-02 22:12:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 22:12:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-02 22:12:19,370 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-02 22:12:19,371 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-02 22:12:19,371 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 22:12:19,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-12-02 22:12:19,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:12:19,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:12:19,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:12:19,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 22:12:19,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 22:12:19,372 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-12-02 22:12:19,372 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-12-02 22:12:19,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-02 22:12:19,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:19,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:19,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-12-02 22:12:19,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:19,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:12:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:19,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-12-02 22:12:19,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:19,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:19,523 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 22:12:19,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 22:12:19,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 22:12:19,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 22:12:19,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 22:12:19,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:12:19,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 22:12:19,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 22:12:19,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 22:12:19,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 22:12:19,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 22:12:19,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:19,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 22:12:19,837 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 22:12:19,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:19,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:19,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:19,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:19,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:19,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:19,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:19,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:19,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:19,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:19,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:19,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:19,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:19,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:19,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:19,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:19,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:19,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:19,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:19,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:19,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:19,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:19,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:19,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:19,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:19,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:19,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:19,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:19,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:19,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:19,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:19,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:19,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:19,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:19,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:19,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:19,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:19,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:19,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:19,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:19,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:19,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:19,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:19,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:19,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:19,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:19,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:19,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:19,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:19,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:19,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:19,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:19,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:19,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:19,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:19,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:19,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:19,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:19,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:19,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:19,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:19,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:19,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:19,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:19,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:19,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:19,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:19,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:19,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:19,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:19,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:19,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:19,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:19,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:19,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:19,917 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 22:12:19,934 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 22:12:19,934 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 22:12:19,935 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 22:12:19,937 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 22:12:19,937 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 22:12:19,937 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-12-02 22:12:19,943 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 22:12:19,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:19,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:19,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:12:19,992 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 22:12:19,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-02 22:12:20,014 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-12-02 22:12:20,014 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-12-02 22:12:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 22:12:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-02 22:12:20,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-02 22:12:20,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:20,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-02 22:12:20,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:20,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-12-02 22:12:20,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:20,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-12-02 22:12:20,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 22:12:20,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-12-02 22:12:20,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 22:12:20,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 22:12:20,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-02 22:12:20,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 22:12:20,018 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 22:12:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-02 22:12:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-02 22:12:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 22:12:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-12-02 22:12:20,019 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-02 22:12:20,019 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-02 22:12:20,019 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 22:12:20,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-12-02 22:12:20,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 22:12:20,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:12:20,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:12:20,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 22:12:20,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 22:12:20,020 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-12-02 22:12:20,021 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-12-02 22:12:20,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-02 22:12:20,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:20,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:20,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:20,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:20,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-12-02 22:12:20,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:20,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-12-02 22:12:20,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:20,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,174 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 22:12:20,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 22:12:20,175 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 22:12:20,175 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 22:12:20,175 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 22:12:20,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:12:20,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 22:12:20,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 22:12:20,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 22:12:20,175 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 22:12:20,175 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 22:12:20,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,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-12-02 22:12:20,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,422 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 22:12:20,422 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 22:12:20,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,488 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:12:20,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,489 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:12:20,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 22:12:20,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 22:12:20,498 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 22:12:20,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 22:12:20,499 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 22:12:20,499 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 22:12:20,499 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-12-02 22:12:20,510 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 22:12:20,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 22:12:20,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:20,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:20,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:12:20,559 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 22:12:20,559 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 22:12:20,569 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-12-02 22:12:20,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 22:12:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 22:12:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-02 22:12:20,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 22:12:20,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:20,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-02 22:12:20,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:20,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 22:12:20,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:20,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-12-02 22:12:20,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 22:12:20,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-12-02 22:12:20,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 22:12:20,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 22:12:20,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-02 22:12:20,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 22:12:20,572 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 22:12:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-02 22:12:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-02 22:12:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 22:12:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-02 22:12:20,573 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-02 22:12:20,573 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-02 22:12:20,573 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 22:12:20,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-02 22:12:20,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 22:12:20,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:12:20,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:12:20,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:12:20,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 22:12:20,574 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-12-02 22:12:20,574 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-12-02 22:12:20,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:20,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-12-02 22:12:20,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:20,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:20,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:20,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:20,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-12-02 22:12:20,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:20,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:12:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-12-02 22:12:20,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:12:20,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:12:20,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:12:20,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:12:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:12:20,727 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 22:12:20,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 22:12:20,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 22:12:20,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 22:12:20,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 22:12:20,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:12:20,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 22:12:20,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 22:12:20,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-02 22:12:20,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 22:12:20,727 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 22:12:20,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:12:20,943 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 22:12:20,944 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 22:12:20,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:20,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:20,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:20,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:20,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:20,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:20,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:20,994 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:12:20,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:20,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:20,995 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:12:20,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:20,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:20,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:21,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:21,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:21,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:21,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:21,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:12:21,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:12:21,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:12:21,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:12:21,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:12:21,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:12:21,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:12:21,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:12:21,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:12:21,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:12:21,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:12:21,004 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 22:12:21,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 22:12:21,005 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 22:12:21,006 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 22:12:21,006 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 22:12:21,006 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 22:12:21,006 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-12-02 22:12:21,013 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 22:12:21,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 22:12:21,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:21,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:21,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:12:21,048 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 22:12:21,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-02 22:12:21,060 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-12-02 22:12:21,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 22:12:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 22:12:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-02 22:12:21,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-02 22:12:21,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:21,061 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 22:12:21,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:21,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:21,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:12:21,093 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-12-02 22:12:21,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-02 22:12:21,102 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-12-02 22:12:21,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 22:12:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 22:12:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-02 22:12:21,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-02 22:12:21,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:21,103 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 22:12:21,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:21,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:21,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:12:21,130 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-12-02 22:12:21,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-02 22:12:21,141 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-12-02 22:12:21,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 22:12:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 22:12:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-02 22:12:21,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-02 22:12:21,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:21,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-02 22:12:21,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:21,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-02 22:12:21,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:12:21,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-12-02 22:12:21,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 22:12:21,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-12-02 22:12:21,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 22:12:21,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 22:12:21,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 22:12:21,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 22:12:21,144 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:12:21,144 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:12:21,144 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:12:21,144 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 22:12:21,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 22:12:21,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 22:12:21,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 22:12:21,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 10:12:21 BoogieIcfgContainer [2018-12-02 22:12:21,149 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 22:12:21,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 22:12:21,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 22:12:21,149 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 22:12:21,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:12:19" (3/4) ... [2018-12-02 22:12:21,151 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 22:12:21,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 22:12:21,152 INFO L168 Benchmark]: Toolchain (without parser) took 2408.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 951.7 MB in the beginning and 826.4 MB in the end (delta: 125.3 MB). Peak memory consumption was 219.7 MB. Max. memory is 11.5 GB. [2018-12-02 22:12:21,153 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:12:21,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-02 22:12:21,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 22:12:21,154 INFO L168 Benchmark]: Boogie Preprocessor took 13.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:12:21,154 INFO L168 Benchmark]: RCFGBuilder took 143.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 22:12:21,154 INFO L168 Benchmark]: BuchiAutomizer took 1980.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 826.4 MB in the end (delta: 237.9 MB). Peak memory consumption was 237.9 MB. Max. memory is 11.5 GB. [2018-12-02 22:12:21,155 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.1 GB. Free memory is still 826.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:12:21,156 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 143.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1980.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 826.4 MB in the end (delta: 237.9 MB). Peak memory consumption was 237.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.1 GB. Free memory is still 826.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 1.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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.0s 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: 6ms 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...