./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 10c50c605d9fb7cd886e3d668ba568a2b619230b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:34:34,832 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:34:34,833 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:34:34,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:34:34,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:34:34,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:34:34,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:34:34,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:34:34,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:34:34,844 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:34:34,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:34:34,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:34:34,845 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:34:34,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:34:34,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:34:34,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:34:34,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:34:34,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:34:34,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:34:34,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:34:34,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:34:34,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:34:34,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:34:34,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:34:34,854 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:34:34,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:34:34,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:34:34,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:34:34,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:34:34,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:34:34,857 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:34:34,857 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:34:34,858 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:34:34,858 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:34:34,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:34:34,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:34:34,859 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:34:34,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:34:34,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:34:34,869 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:34:34,869 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:34:34,869 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:34:34,869 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:34:34,869 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:34:34,870 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:34:34,870 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:34:34,870 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:34:34,870 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:34:34,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:34:34,870 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:34:34,870 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:34:34,870 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:34:34,871 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:34:34,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:34:34,871 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:34:34,871 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:34:34,871 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:34:34,871 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:34:34,871 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:34:34,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:34:34,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:34:34,872 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:34:34,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:34:34,872 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:34:34,872 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:34:34,873 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:34:34,873 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_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10c50c605d9fb7cd886e3d668ba568a2b619230b [2018-11-23 06:34:34,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:34:34,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:34:34,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:34:34,908 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:34:34,908 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:34:34,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2018-11-23 06:34:34,951 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/data/70564cb64/e962345579e54a7fbd4a7cdc46dbfa9e/FLAG48f48c534 [2018-11-23 06:34:35,334 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:34:35,335 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2018-11-23 06:34:35,344 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/data/70564cb64/e962345579e54a7fbd4a7cdc46dbfa9e/FLAG48f48c534 [2018-11-23 06:34:35,716 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/bin-2019/uautomizer/data/70564cb64/e962345579e54a7fbd4a7cdc46dbfa9e [2018-11-23 06:34:35,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:34:35,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:34:35,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:34:35,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:34:35,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:34:35,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:34:35" (1/1) ... [2018-11-23 06:34:35,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383c9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:35, skipping insertion in model container [2018-11-23 06:34:35,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:34:35" (1/1) ... [2018-11-23 06:34:35,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:34:35,758 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:34:35,937 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:34:35,944 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:34:35,968 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:34:36,037 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:34:36,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36 WrapperNode [2018-11-23 06:34:36,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:34:36,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:34:36,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:34:36,039 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:34:36,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... [2018-11-23 06:34:36,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... [2018-11-23 06:34:36,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:34:36,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:34:36,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:34:36,069 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:34:36,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... [2018-11-23 06:34:36,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... [2018-11-23 06:34:36,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... [2018-11-23 06:34:36,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... [2018-11-23 06:34:36,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... [2018-11-23 06:34:36,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... [2018-11-23 06:34:36,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... [2018-11-23 06:34:36,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:34:36,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:34:36,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:34:36,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:34:36,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4543fff-330c-45ce-9243-700e48530596/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-11-23 06:34:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:34:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:34:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:34:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:34:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:34:36,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:34:36,262 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:34:36,262 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 06:34:36,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:34:36 BoogieIcfgContainer [2018-11-23 06:34:36,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:34:36,263 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:34:36,263 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:34:36,266 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:34:36,267 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:34:36,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:34:35" (1/3) ... [2018-11-23 06:34:36,268 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a278bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:34:36, skipping insertion in model container [2018-11-23 06:34:36,268 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:34:36,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:34:36" (2/3) ... [2018-11-23 06:34:36,268 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a278bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:34:36, skipping insertion in model container [2018-11-23 06:34:36,268 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:34:36,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:34:36" (3/3) ... [2018-11-23 06:34:36,270 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-termination.c.i [2018-11-23 06:34:36,312 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:34:36,313 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:34:36,313 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:34:36,313 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:34:36,313 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:34:36,313 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:34:36,313 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:34:36,313 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:34:36,313 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:34:36,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 06:34:36,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 06:34:36,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:34:36,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:34:36,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:34:36,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:34:36,348 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:34:36,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 06:34:36,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 06:34:36,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:34:36,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:34:36,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:34:36,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:34:36,354 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L561true assume !(main_~array_size~0 < 1); 14#L561-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 3#L551-3true [2018-11-23 06:34:36,354 INFO L796 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N); 12#L552-3true assume !true; 13#L551-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 3#L551-3true [2018-11-23 06:34:36,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-23 06:34:36,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:36,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:36,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:36,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:36,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-11-23 06:34:36,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:36,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:34:36,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:34:36,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:34:36,463 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:34:36,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:34:36,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:34:36,473 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-23 06:34:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:34:36,478 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-11-23 06:34:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:34:36,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-23 06:34:36,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 06:34:36,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-11-23 06:34:36,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 06:34:36,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 06:34:36,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-23 06:34:36,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:34:36,484 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 06:34:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-23 06:34:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-23 06:34:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 06:34:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-23 06:34:36,505 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 06:34:36,505 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 06:34:36,506 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:34:36,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-23 06:34:36,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 06:34:36,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:34:36,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:34:36,507 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:34:36,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:34:36,507 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L561 assume !(main_~array_size~0 < 1); 41#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 36#L551-3 [2018-11-23 06:34:36,507 INFO L796 eck$LassoCheckResult]: Loop: 36#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 37#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 40#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 36#L551-3 [2018-11-23 06:34:36,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-23 06:34:36,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:36,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:36,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-11-23 06:34:36,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:36,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:34:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:36,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-11-23 06:34:36,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:36,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:36,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:36,740 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:34:36,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:34:36,741 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:34:36,741 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:34:36,742 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:34:36,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:34:36,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:34:36,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:34:36,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 06:34:36,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:34:36,742 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:34:36,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:36,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,146 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:34:37,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:34:37,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:37,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:37,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:37,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:37,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:37,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:37,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:37,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:37,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:37,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:37,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:37,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:37,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,242 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:34:37,269 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:34:37,270 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:34:37,271 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:34:37,274 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:34:37,274 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:34:37,274 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-23 06:34:37,298 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:34:37,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:37,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:37,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:34:37,361 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:34:37,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-23 06:34:37,385 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2018-11-23 06:34:37,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:34:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:34:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-23 06:34:37,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-23 06:34:37,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:37,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 06:34:37,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:37,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-23 06:34:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:37,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-23 06:34:37,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:34:37,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-11-23 06:34:37,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 06:34:37,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 06:34:37,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-23 06:34:37,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:34:37,390 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 06:34:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-23 06:34:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-23 06:34:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 06:34:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-23 06:34:37,392 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 06:34:37,392 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 06:34:37,392 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:34:37,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-23 06:34:37,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:34:37,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:34:37,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:34:37,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:34:37,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:34:37,393 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 116#L561 assume !(main_~array_size~0 < 1); 121#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 111#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L552-3 [2018-11-23 06:34:37,393 INFO L796 eck$LassoCheckResult]: Loop: 113#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 118#L552-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 113#L552-3 [2018-11-23 06:34:37,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:37,394 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-23 06:34:37,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:37,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:37,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:37,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-23 06:34:37,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:37,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:37,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-23 06:34:37,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:37,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:37,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:37,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,566 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:34:37,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:34:37,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:34:37,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:34:37,567 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:34:37,567 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:34:37,567 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:34:37,567 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:34:37,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 06:34:37,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:34:37,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:34:37,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:37,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:34:37,834 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:34:37,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:37,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:37,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:37,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:37,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:37,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:37,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:37,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:37,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:37,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:37,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,875 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:34:37,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,877 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:34:37,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:37,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:37,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:37,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:37,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:37,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:37,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:37,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:37,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:37,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:37,885 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:34:37,886 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:34:37,887 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:34:37,887 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:34:37,887 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:34:37,887 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:34:37,887 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-23 06:34:37,911 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:34:37,912 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:34:37,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:37,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:37,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:34:37,955 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:34:37,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 06:34:37,970 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 7 states. [2018-11-23 06:34:37,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:34:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:34:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-23 06:34:37,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 06:34:37,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:37,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 06:34:37,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:37,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 06:34:37,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:37,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-23 06:34:37,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:34:37,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-11-23 06:34:37,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 06:34:37,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 06:34:37,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-23 06:34:37,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:34:37,974 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 06:34:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-23 06:34:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 06:34:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 06:34:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-23 06:34:37,975 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 06:34:37,975 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 06:34:37,975 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:34:37,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-23 06:34:37,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:34:37,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:34:37,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:34:37,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:34:37,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:34:37,977 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 205#L561 assume !(main_~array_size~0 < 1); 210#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 199#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 200#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 208#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 209#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 201#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 203#L552-3 [2018-11-23 06:34:37,977 INFO L796 eck$LassoCheckResult]: Loop: 203#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 207#L552-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 203#L552-3 [2018-11-23 06:34:37,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:37,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-11-23 06:34:37,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:37,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:37,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:37,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-23 06:34:37,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:37,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:34:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:37,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-11-23 06:34:37,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:37,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:37,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:34:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:34:38,156 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:34:38,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:34:38,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:34:38,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:34:38,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:34:38,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:34:38,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:34:38,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:34:38,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 06:34:38,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:34:38,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:34:38,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:34:38,407 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:34:38,407 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:34:38,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:38,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:38,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:38,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:38,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:38,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:38,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:38,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:38,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,462 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:34:38,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,463 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:34:38,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:34:38,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:34:38,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:34:38,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:34:38,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:34:38,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:34:38,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:34:38,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:34:38,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:34:38,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:34:38,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:34:38,472 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:34:38,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:34:38,473 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:34:38,474 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:34:38,474 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:34:38,474 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:34:38,474 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-23 06:34:38,510 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 06:34:38,511 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:34:38,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:38,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:38,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:34:38,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:34:38,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 06:34:38,552 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2018-11-23 06:34:38,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:34:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:34:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-23 06:34:38,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 06:34:38,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:38,554 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:34:38,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:38,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:38,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:34:38,591 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:34:38,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 06:34:38,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2018-11-23 06:34:38,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:34:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:34:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-23 06:34:38,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 06:34:38,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:38,603 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:34:38,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:38,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:38,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:34:38,644 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:34:38,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 06:34:38,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 6 states. [2018-11-23 06:34:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:34:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:34:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-23 06:34:38,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 06:34:38,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:38,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-23 06:34:38,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:38,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 06:34:38,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:34:38,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-23 06:34:38,664 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:34:38,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-11-23 06:34:38,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:34:38,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:34:38,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:34:38,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:34:38,664 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:34:38,664 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:34:38,664 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:34:38,664 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:34:38,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:34:38,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:34:38,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:34:38,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:34:38 BoogieIcfgContainer [2018-11-23 06:34:38,671 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:34:38,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:34:38,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:34:38,672 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:34:38,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:34:36" (3/4) ... [2018-11-23 06:34:38,676 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:34:38,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:34:38,676 INFO L168 Benchmark]: Toolchain (without parser) took 2957.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.6 MB in the beginning and 892.4 MB in the end (delta: 64.2 MB). Peak memory consumption was 201.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:38,678 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:34:38,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:38,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.81 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:38,679 INFO L168 Benchmark]: Boogie Preprocessor took 16.00 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:38,679 INFO L168 Benchmark]: RCFGBuilder took 178.38 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:38,680 INFO L168 Benchmark]: BuchiAutomizer took 2407.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.4 MB in the end (delta: 220.9 MB). Peak memory consumption was 220.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:38,680 INFO L168 Benchmark]: Witness Printer took 4.20 ms. Allocated memory is still 1.2 GB. Free memory is still 892.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:34:38,683 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.81 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.00 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 178.38 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2407.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.4 MB in the end (delta: 220.9 MB). Peak memory consumption was 220.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.20 ms. Allocated memory is still 1.2 GB. Free memory is still 892.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 33 SDslu, 1 SDs, 0 SdLazy, 43 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax113 hnf99 lsp79 ukn80 mio100 lsp58 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...