./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_9a7948e7-5b20-406c-8148-f2c22bd71142/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/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_9a7948e7-5b20-406c-8148-f2c22bd71142/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/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-01 07:58:33,650 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 07:58:33,652 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 07:58:33,660 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 07:58:33,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 07:58:33,661 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 07:58:33,662 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 07:58:33,664 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 07:58:33,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 07:58:33,666 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 07:58:33,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 07:58:33,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 07:58:33,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 07:58:33,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 07:58:33,669 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 07:58:33,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 07:58:33,670 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 07:58:33,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 07:58:33,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 07:58:33,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 07:58:33,674 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 07:58:33,675 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 07:58:33,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 07:58:33,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 07:58:33,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 07:58:33,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 07:58:33,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 07:58:33,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 07:58:33,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 07:58:33,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 07:58:33,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 07:58:33,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 07:58:33,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 07:58:33,682 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 07:58:33,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 07:58:33,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 07:58:33,683 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 07:58:33,690 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 07:58:33,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 07:58:33,691 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 07:58:33,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 07:58:33,691 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 07:58:33,691 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 07:58:33,691 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 07:58:33,691 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 07:58:33,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 07:58:33,692 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 07:58:33,693 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 07:58:33,693 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 07:58:33,693 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 07:58:33,693 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 07:58:33,693 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 07:58:33,693 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 07:58:33,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 07:58:33,693 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 07:58:33,693 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 07:58:33,693 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 07:58:33,693 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 07:58:33,694 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 07:58:33,694 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 07:58:33,694 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_9a7948e7-5b20-406c-8148-f2c22bd71142/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-01 07:58:33,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 07:58:33,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 07:58:33,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 07:58:33,721 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 07:58:33,721 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 07:58:33,722 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-12-01 07:58:33,761 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/bin-2019/uautomizer/data/5b1e22ab2/81fcbddd8efb4bc6b185c356fc4e3b2a/FLAG35cbc8746 [2018-12-01 07:58:34,106 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 07:58:34,107 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-12-01 07:58:34,113 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/bin-2019/uautomizer/data/5b1e22ab2/81fcbddd8efb4bc6b185c356fc4e3b2a/FLAG35cbc8746 [2018-12-01 07:58:34,120 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/bin-2019/uautomizer/data/5b1e22ab2/81fcbddd8efb4bc6b185c356fc4e3b2a [2018-12-01 07:58:34,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 07:58:34,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 07:58:34,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 07:58:34,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 07:58:34,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 07:58:34,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7300e139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34, skipping insertion in model container [2018-12-01 07:58:34,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 07:58:34,151 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 07:58:34,297 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 07:58:34,303 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 07:58:34,360 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 07:58:34,379 INFO L195 MainTranslator]: Completed translation [2018-12-01 07:58:34,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34 WrapperNode [2018-12-01 07:58:34,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 07:58:34,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 07:58:34,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 07:58:34,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 07:58:34,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 07:58:34,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 07:58:34,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 07:58:34,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 07:58:34,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... [2018-12-01 07:58:34,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 07:58:34,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 07:58:34,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 07:58:34,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 07:58:34,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a7948e7-5b20-406c-8148-f2c22bd71142/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-01 07:58:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 07:58:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 07:58:34,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 07:58:34,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 07:58:34,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 07:58:34,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 07:58:34,571 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 07:58:34,571 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 07:58:34,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:58:34 BoogieIcfgContainer [2018-12-01 07:58:34,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 07:58:34,572 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 07:58:34,572 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 07:58:34,575 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 07:58:34,576 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 07:58:34,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 07:58:34" (1/3) ... [2018-12-01 07:58:34,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2028dc03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 07:58:34, skipping insertion in model container [2018-12-01 07:58:34,577 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 07:58:34,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:58:34" (2/3) ... [2018-12-01 07:58:34,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2028dc03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 07:58:34, skipping insertion in model container [2018-12-01 07:58:34,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 07:58:34,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:58:34" (3/3) ... [2018-12-01 07:58:34,579 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-12-01 07:58:34,617 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 07:58:34,617 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 07:58:34,618 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 07:58:34,618 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 07:58:34,618 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 07:58:34,618 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 07:58:34,618 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 07:58:34,618 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 07:58:34,618 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 07:58:34,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-01 07:58:34,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 07:58:34,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 07:58:34,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 07:58:34,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 07:58:34,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 07:58:34,644 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 07:58:34,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-01 07:58:34,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 07:58:34,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 07:58:34,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 07:58:34,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 07:58:34,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 07:58:34,650 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-01 07:58:34,650 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-01 07:58:34,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-01 07:58:34,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:34,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:58:34,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:34,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:34,721 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-12-01 07:58:34,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:34,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:34,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:58:34,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:34,737 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-01 07:58:34,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:58:34,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 07:58:34,741 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 07:58:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 07:58:34,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 07:58:34,751 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-12-01 07:58:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:58:34,754 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-01 07:58:34,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 07:58:34,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-12-01 07:58:34,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 07:58:34,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-12-01 07:58:34,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-01 07:58:34,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-01 07:58:34,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-12-01 07:58:34,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 07:58:34,760 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-01 07:58:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-12-01 07:58:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-01 07:58:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 07:58:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-01 07:58:34,776 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-01 07:58:34,776 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-01 07:58:34,776 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 07:58:34,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-12-01 07:58:34,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 07:58:34,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 07:58:34,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 07:58:34,777 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 07:58:34,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 07:58:34,777 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-01 07:58:34,777 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-01 07:58:34,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-01 07:58:34,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:34,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:58:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:34,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:34,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-12-01 07:58:34,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:34,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 07:58:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:34,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-12-01 07:58:34,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:34,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:34,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:58:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:34,938 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 07:58:34,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 07:58:34,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 07:58:34,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 07:58:34,939 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 07:58:34,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 07:58:34,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 07:58:34,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 07:58:34,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-01 07:58:34,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 07:58:34,940 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 07:58:34,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 07:58:34,961 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-01 07:58:34,963 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-01 07:58:34,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 07:58:34,967 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-01 07:58:34,968 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-01 07:58:34,970 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-01 07:58:35,059 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-01 07:58:35,060 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-01 07:58:35,062 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-01 07:58:35,065 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-01 07:58:35,066 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-01 07:58:35,068 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-01 07:58:35,235 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 07:58:35,238 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 07:58:35,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:35,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:35,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:35,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,299 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 07:58:35,319 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 07:58:35,319 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-01 07:58:35,320 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 07:58:35,321 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 07:58:35,322 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 07:58:35,322 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-01 07:58:35,331 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 07:58:35,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:35,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:35,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:35,383 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-01 07:58:35,385 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-01 07:58:35,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-01 07:58:35,411 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-01 07:58:35,411 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-01 07:58:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 07:58:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-01 07:58:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-01 07:58:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:35,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-01 07:58:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:35,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-12-01 07:58:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:35,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-12-01 07:58:35,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 07:58:35,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-12-01 07:58:35,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-01 07:58:35,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-01 07:58:35,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-01 07:58:35,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 07:58:35,416 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-01 07:58:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-01 07:58:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-01 07:58:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 07:58:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-12-01 07:58:35,417 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-01 07:58:35,418 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-01 07:58:35,418 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 07:58:35,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-12-01 07:58:35,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 07:58:35,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 07:58:35,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 07:58:35,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 07:58:35,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 07:58:35,419 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-01 07:58:35,419 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~post5;havoc test_fun_#t~mem4;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-01 07:58:35,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:35,419 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-01 07:58:35,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:35,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:58:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-12-01 07:58:35,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:35,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:58:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-12-01 07:58:35,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:35,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:58:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,576 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 07:58:35,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 07:58:35,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 07:58:35,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 07:58:35,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 07:58:35,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 07:58:35,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 07:58:35,577 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 07:58:35,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-01 07:58:35,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 07:58:35,577 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 07:58:35,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 07:58:35,581 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-01 07:58:35,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 07:58:35,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 07:58:35,586 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-01 07:58:35,587 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-01 07:58:35,588 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-01 07:58:35,589 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-01 07:58:35,590 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-01 07:58:35,592 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-01 07:58:35,593 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-01 07:58:35,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 07:58:35,596 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-01 07:58:35,794 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 07:58:35,795 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 07:58:35,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:35,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:35,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:35,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:35,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:35,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:35,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 07:58:35,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,854 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 07:58:35,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:35,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:35,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:35,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:35,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:35,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:35,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:35,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:35,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:35,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:35,864 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 07:58:35,865 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 07:58:35,865 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 07:58:35,866 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 07:58:35,866 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 07:58:35,866 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 07:58:35,866 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-01 07:58:35,872 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 07:58:35,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 07:58:35,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:35,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:35,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:35,923 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-01 07:58:35,924 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-01 07:58:35,924 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 07:58:35,936 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-01 07:58:35,937 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-01 07:58:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 07:58:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-01 07:58:35,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 07:58:35,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:35,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 07:58:35,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:35,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-01 07:58:35,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:35,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-12-01 07:58:35,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 07:58:35,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-12-01 07:58:35,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-01 07:58:35,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-01 07:58:35,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-01 07:58:35,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 07:58:35,940 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-01 07:58:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-01 07:58:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-01 07:58:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-01 07:58:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-01 07:58:35,942 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-01 07:58:35,942 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-01 07:58:35,942 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 07:58:35,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-01 07:58:35,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 07:58:35,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 07:58:35,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 07:58:35,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:58:35,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 07:58:35,960 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-01 07:58:35,960 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~post5;havoc test_fun_#t~mem4;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-01 07:58:35,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-12-01 07:58:35,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:35,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:58:35,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-12-01 07:58:35,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:35,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 07:58:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-12-01 07:58:35,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:58:35,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:58:35,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 07:58:35,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:58:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 07:58:36,125 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 07:58:36,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 07:58:36,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 07:58:36,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 07:58:36,125 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 07:58:36,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 07:58:36,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 07:58:36,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 07:58:36,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-01 07:58:36,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 07:58:36,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 07:58:36,128 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-01 07:58:36,129 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-01 07:58:36,131 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-01 07:58:36,133 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-01 07:58:36,133 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-01 07:58:36,134 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-01 07:58:36,135 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-01 07:58:36,136 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-01 07:58:36,137 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-01 07:58:36,138 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-01 07:58:36,138 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-01 07:58:36,139 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-01 07:58:36,140 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-01 07:58:36,332 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 07:58:36,332 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 07:58:36,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:36,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:36,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:36,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:36,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:36,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:36,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:36,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:36,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:36,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:36,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,375 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 07:58:36,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,376 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 07:58:36,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:36,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 07:58:36,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 07:58:36,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 07:58:36,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 07:58:36,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 07:58:36,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 07:58:36,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 07:58:36,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 07:58:36,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 07:58:36,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 07:58:36,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 07:58:36,385 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 07:58:36,386 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 07:58:36,387 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 07:58:36,387 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 07:58:36,387 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 07:58:36,387 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 07:58:36,387 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-01 07:58:36,397 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-01 07:58:36,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 07:58:36,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:36,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:36,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:36,432 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-01 07:58:36,432 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-01 07:58:36,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-01 07:58:36,445 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-01 07:58:36,446 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-01 07:58:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 07:58:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-01 07:58:36,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 07:58:36,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:36,446 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 07:58:36,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:36,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:36,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:36,473 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-01 07:58:36,474 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-01 07:58:36,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-01 07:58:36,484 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-01 07:58:36,484 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-01 07:58:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 07:58:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-01 07:58:36,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 07:58:36,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:36,485 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 07:58:36,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:58:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:36,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:58:36,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:58:36,512 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-01 07:58:36,512 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-01 07:58:36,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-01 07:58:36,523 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-01 07:58:36,524 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-01 07:58:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 07:58:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-01 07:58:36,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 07:58:36,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:36,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-01 07:58:36,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:36,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-01 07:58:36,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 07:58:36,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-12-01 07:58:36,526 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 07:58:36,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-12-01 07:58:36,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 07:58:36,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 07:58:36,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 07:58:36,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 07:58:36,526 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 07:58:36,526 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 07:58:36,526 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 07:58:36,526 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 07:58:36,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 07:58:36,526 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 07:58:36,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 07:58:36,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 07:58:36 BoogieIcfgContainer [2018-12-01 07:58:36,531 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 07:58:36,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 07:58:36,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 07:58:36,531 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 07:58:36,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:58:34" (3/4) ... [2018-12-01 07:58:36,533 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 07:58:36,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 07:58:36,534 INFO L168 Benchmark]: Toolchain (without parser) took 2411.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -93.1 MB). Peak memory consumption was 140.7 MB. Max. memory is 11.5 GB. [2018-12-01 07:58:36,535 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 07:58:36,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-01 07:58:36,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 07:58:36,536 INFO L168 Benchmark]: Boogie Preprocessor took 14.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 07:58:36,536 INFO L168 Benchmark]: RCFGBuilder took 152.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-01 07:58:36,536 INFO L168 Benchmark]: BuchiAutomizer took 1958.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 151.7 MB. Max. memory is 11.5 GB. [2018-12-01 07:58:36,537 INFO L168 Benchmark]: Witness Printer took 2.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 07:58:36,538 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 152.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1958.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 151.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s 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: 7ms 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...