./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a031a295ba45c7116aee95a6abc238e63986cbf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 04:11:52,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:11:52,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:11:52,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:11:52,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:11:52,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:11:52,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:11:52,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:11:52,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:11:52,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:11:52,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:11:52,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:11:52,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:11:52,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:11:52,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:11:52,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:11:52,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:11:52,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:11:52,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:11:52,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:11:52,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:11:52,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:11:52,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:11:52,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:11:52,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:11:52,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:11:52,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:11:52,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:11:52,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:11:52,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:11:52,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:11:52,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:11:52,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:11:52,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:11:52,336 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:11:52,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:11:52,336 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 04:11:52,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:11:52,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:11:52,345 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:11:52,345 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:11:52,345 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 04:11:52,345 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 04:11:52,345 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 04:11:52,345 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 04:11:52,345 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 04:11:52,345 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 04:11:52,345 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 04:11:52,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:11:52,346 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 04:11:52,347 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:11:52,347 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 04:11:52,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:11:52,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:11:52,347 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 04:11:52,347 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:11:52,347 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 04:11:52,347 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 04:11:52,348 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 04:11:52,348 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_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a031a295ba45c7116aee95a6abc238e63986cbf [2018-12-09 04:11:52,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:11:52,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:11:52,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:11:52,375 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:11:52,376 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:11:52,376 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-12-09 04:11:52,411 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/data/f1fdbf837/06fabb6fee0b4dc4923eef8eac7612d2/FLAG360f4e694 [2018-12-09 04:11:52,865 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:11:52,865 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-12-09 04:11:52,874 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/data/f1fdbf837/06fabb6fee0b4dc4923eef8eac7612d2/FLAG360f4e694 [2018-12-09 04:11:52,883 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/bin-2019/uautomizer/data/f1fdbf837/06fabb6fee0b4dc4923eef8eac7612d2 [2018-12-09 04:11:52,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:11:52,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:11:52,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:11:52,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:11:52,888 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:11:52,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:11:52" (1/1) ... [2018-12-09 04:11:52,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef7631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:52, skipping insertion in model container [2018-12-09 04:11:52,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:11:52" (1/1) ... [2018-12-09 04:11:52,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:11:52,913 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:11:53,054 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:11:53,061 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:11:53,125 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:11:53,152 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:11:53,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53 WrapperNode [2018-12-09 04:11:53,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:11:53,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:11:53,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:11:53,153 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:11:53,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... [2018-12-09 04:11:53,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... [2018-12-09 04:11:53,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:11:53,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:11:53,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:11:53,178 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:11:53,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... [2018-12-09 04:11:53,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... [2018-12-09 04:11:53,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... [2018-12-09 04:11:53,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... [2018-12-09 04:11:53,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... [2018-12-09 04:11:53,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... [2018-12-09 04:11:53,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... [2018-12-09 04:11:53,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:11:53,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:11:53,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:11:53,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:11:53,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e7663d-8bf4-4d56-9748-96b57aafd055/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-09 04:11:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:11:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 04:11:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:11:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:11:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:11:53,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:11:53,342 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:11:53,342 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 04:11:53,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:11:53 BoogieIcfgContainer [2018-12-09 04:11:53,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:11:53,343 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 04:11:53,343 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 04:11:53,346 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 04:11:53,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:11:53,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 04:11:52" (1/3) ... [2018-12-09 04:11:53,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@399b2da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 04:11:53, skipping insertion in model container [2018-12-09 04:11:53,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:11:53,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:11:53" (2/3) ... [2018-12-09 04:11:53,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@399b2da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 04:11:53, skipping insertion in model container [2018-12-09 04:11:53,348 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:11:53,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:11:53" (3/3) ... [2018-12-09 04:11:53,349 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-12-09 04:11:53,383 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 04:11:53,383 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 04:11:53,383 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 04:11:53,383 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 04:11:53,383 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:11:53,384 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:11:53,384 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 04:11:53,384 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:11:53,384 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 04:11:53,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-09 04:11:53,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 04:11:53,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:11:53,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:11:53,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 04:11:53,409 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 04:11:53,409 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 04:11:53,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-09 04:11:53,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 04:11:53,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:11:53,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:11:53,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 04:11:53,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 04:11:53,416 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#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; 4#L554true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9#L554-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; 11#L544-3true [2018-12-09 04:11:53,416 INFO L796 eck$LassoCheckResult]: Loop: 11#L544-3true assume !!(test_fun_~i~0 < test_fun_~N); 6#L545-3true assume !true; 7#L544-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L544-3true [2018-12-09 04:11:53,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-09 04:11:53,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:53,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:53,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:11:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:53,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:53,499 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-12-09 04:11:53,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:53,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:11:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:53,517 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-09 04:11:53,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:11:53,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:11:53,521 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:11:53,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 04:11:53,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 04:11:53,531 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-12-09 04:11:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:11:53,534 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-09 04:11:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 04:11:53,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-12-09 04:11:53,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 04:11:53,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-12-09 04:11:53,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 04:11:53,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 04:11:53,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-12-09 04:11:53,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:11:53,540 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-09 04:11:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-12-09 04:11:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-09 04:11:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 04:11:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-09 04:11:53,556 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-09 04:11:53,556 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-09 04:11:53,556 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 04:11:53,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-12-09 04:11:53,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 04:11:53,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:11:53,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:11:53,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 04:11:53,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 04:11:53,557 INFO L794 eck$LassoCheckResult]: Stem: 40#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#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L554-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; 39#L544-3 [2018-12-09 04:11:53,557 INFO L796 eck$LassoCheckResult]: Loop: 39#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 36#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 37#L545-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 38#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 39#L544-3 [2018-12-09 04:11:53,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:53,558 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-09 04:11:53,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:53,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:53,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:11:53,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:53,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-12-09 04:11:53,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:53,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:11:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:53,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-12-09 04:11:53,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:53,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:53,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:11:53,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:53,718 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 04:11:53,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 04:11:53,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 04:11:53,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 04:11:53,719 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 04:11:53,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:11:53,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 04:11:53,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 04:11:53,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-09 04:11:53,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 04:11:53,720 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 04:11:53,737 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-09 04:11:53,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-09 04:11:53,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-09 04:11:53,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-09 04:11:53,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-09 04:11:53,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-09 04:11:53,751 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-09 04:11:53,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:53,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:53,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:53,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:53,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:53,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:53,996 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 04:11:53,999 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 04:11:54,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:54,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:54,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:54,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,059 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 04:11:54,078 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 04:11:54,078 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 04:11:54,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 04:11:54,080 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 04:11:54,080 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 04:11:54,081 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-09 04:11:54,091 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 04:11:54,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:54,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:54,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:54,141 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-09 04:11:54,143 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-09 04:11:54,144 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-09 04:11:54,167 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-09 04:11:54,167 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-09 04:11:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 04:11:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-09 04:11:54,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-09 04:11:54,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:54,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-09 04:11:54,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:54,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-12-09 04:11:54,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:54,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-12-09 04:11:54,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 04:11:54,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-12-09 04:11:54,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-09 04:11:54,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 04:11:54,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-09 04:11:54,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 04:11:54,172 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-09 04:11:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-09 04:11:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-09 04:11:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 04:11:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-12-09 04:11:54,173 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-09 04:11:54,173 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-09 04:11:54,173 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 04:11:54,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-12-09 04:11:54,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 04:11:54,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:11:54,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:11:54,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 04:11:54,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 04:11:54,174 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#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; 112#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 120#L554-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; 121#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L545-3 [2018-12-09 04:11:54,174 INFO L796 eck$LassoCheckResult]: Loop: 113#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 114#L545-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#L545-3 [2018-12-09 04:11:54,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:54,174 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-09 04:11:54,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:54,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:54,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:11:54,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:54,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-12-09 04:11:54,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:54,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:54,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:11:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:54,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-12-09 04:11:54,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:54,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:54,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:11:54,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,326 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 04:11:54,326 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 04:11:54,326 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 04:11:54,326 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 04:11:54,326 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 04:11:54,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:11:54,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 04:11:54,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 04:11:54,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-09 04:11:54,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 04:11:54,327 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 04:11:54,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,334 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-09 04:11:54,336 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-09 04:11:54,337 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-09 04:11:54,338 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-09 04:11:54,339 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-09 04:11:54,340 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-09 04:11:54,342 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-09 04:11:54,343 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-09 04:11:54,344 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-09 04:11:54,345 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-09 04:11:54,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,558 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 04:11:54,559 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 04:11:54,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:54,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:54,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:54,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:54,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:54,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:54,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,617 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 04:11:54,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,619 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 04:11:54,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:54,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:54,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:54,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:54,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:54,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:54,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:54,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:54,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:54,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:54,627 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 04:11:54,628 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 04:11:54,629 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 04:11:54,629 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 04:11:54,629 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 04:11:54,629 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 04:11:54,629 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-09 04:11:54,634 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 04:11:54,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 04:11:54,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:54,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:54,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:54,670 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-09 04:11:54,671 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-09 04:11:54,671 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 04:11:54,682 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-09 04:11:54,682 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-09 04:11:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 04:11:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-09 04:11:54,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 04:11:54,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:54,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-09 04:11:54,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:54,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-09 04:11:54,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:54,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-12-09 04:11:54,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 04:11:54,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-12-09 04:11:54,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-09 04:11:54,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-09 04:11:54,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-09 04:11:54,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 04:11:54,684 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-09 04:11:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-09 04:11:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-09 04:11:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 04:11:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-09 04:11:54,685 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-09 04:11:54,685 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-09 04:11:54,685 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 04:11:54,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-09 04:11:54,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 04:11:54,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:11:54,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:11:54,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:11:54,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 04:11:54,686 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#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; 200#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 208#L554-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; 209#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 210#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 212#L545-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 205#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 206#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 201#L545-3 [2018-12-09 04:11:54,686 INFO L796 eck$LassoCheckResult]: Loop: 201#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 202#L545-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; 201#L545-3 [2018-12-09 04:11:54,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-12-09 04:11:54,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:54,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:54,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:11:54,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-12-09 04:11:54,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:54,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:54,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:11:54,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-12-09 04:11:54,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:11:54,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:11:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:11:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:11:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:11:54,854 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 04:11:54,854 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 04:11:54,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 04:11:54,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 04:11:54,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 04:11:54,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:11:54,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 04:11:54,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 04:11:54,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-09 04:11:54,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 04:11:54,855 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 04:11:54,856 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-09 04:11:54,858 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-09 04:11:54,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,864 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-09 04:11:54,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:11:54,867 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-09 04:11:54,868 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-09 04:11:54,869 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-09 04:11:55,066 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 04:11:55,066 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 04:11:55,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:55,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:55,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:55,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:55,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:55,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:55,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:55,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:55,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:55,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:55,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,103 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 04:11:55,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,104 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 04:11:55,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:55,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:11:55,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:11:55,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:11:55,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:11:55,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:11:55,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:11:55,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:11:55,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:11:55,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:11:55,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:11:55,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:11:55,113 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 04:11:55,114 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 04:11:55,115 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 04:11:55,115 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 04:11:55,115 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 04:11:55,115 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 04:11:55,115 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-09 04:11:55,127 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 04:11:55,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 04:11:55,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:55,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:55,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:55,169 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-09 04:11:55,170 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-09 04:11:55,170 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 04:11:55,183 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-09 04:11:55,183 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-09 04:11:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 04:11:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-09 04:11:55,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-09 04:11:55,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:55,184 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 04:11:55,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:55,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:55,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:55,219 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-09 04:11:55,219 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-09 04:11:55,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 04:11:55,229 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-09 04:11:55,229 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-09 04:11:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 04:11:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-09 04:11:55,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-09 04:11:55,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:55,230 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 04:11:55,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:11:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:55,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:11:55,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:11:55,253 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-09 04:11:55,254 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-09 04:11:55,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 04:11:55,263 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-09 04:11:55,263 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-09 04:11:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 04:11:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-09 04:11:55,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-09 04:11:55,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:55,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-09 04:11:55,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:55,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-09 04:11:55,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:11:55,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-12-09 04:11:55,265 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 04:11:55,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-12-09 04:11:55,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 04:11:55,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 04:11:55,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 04:11:55,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:11:55,266 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:11:55,266 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:11:55,266 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:11:55,266 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 04:11:55,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 04:11:55,266 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 04:11:55,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 04:11:55,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 04:11:55 BoogieIcfgContainer [2018-12-09 04:11:55,270 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 04:11:55,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:11:55,270 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:11:55,270 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:11:55,270 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:11:53" (3/4) ... [2018-12-09 04:11:55,273 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 04:11:55,273 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:11:55,273 INFO L168 Benchmark]: Toolchain (without parser) took 2387.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 951.7 MB in the beginning and 845.1 MB in the end (delta: 106.6 MB). Peak memory consumption was 209.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:11:55,274 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:11:55,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 04:11:55,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.40 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:11:55,275 INFO L168 Benchmark]: Boogie Preprocessor took 13.68 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-09 04:11:55,275 INFO L168 Benchmark]: RCFGBuilder took 151.23 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-09 04:11:55,275 INFO L168 Benchmark]: BuchiAutomizer took 1926.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 845.1 MB in the end (delta: 227.9 MB). Peak memory consumption was 227.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:11:55,276 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 1.1 GB. Free memory is still 845.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:11:55,278 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.40 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.68 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 151.23 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1926.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 845.1 MB in the end (delta: 227.9 MB). Peak memory consumption was 227.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.78 ms. Allocated memory is still 1.1 GB. Free memory is still 845.1 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.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. 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: inital135 mio100 ax100 hnf98 lsp90 ukn80 mio100 lsp59 div100 bol100 ite100 ukn100 eq176 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...